English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
 DetailsSummary
  Algorithms for Enumerating all Spanning Trees of an Undirected Graph

Hariharan, R., & Kapoor, S. (1995). Algorithms for Enumerating all Spanning Trees of an Undirected Graph. SIAM Journal on Computing, 24(2), 247-265.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-AC51-B Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-AC52-9
Genre: Journal Article

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Hariharan, Ramesh1, Author           
Kapoor, Sanjiv1, Author           
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 2010-03-021995
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: Peer
 Identifiers: eDoc: 517854
Other: Local-ID: C1256428004B93B8-CB7C272506EC19A7C125645A0048162A-Hariharan-Kapoor95
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: SIAM Journal on Computing
Source Genre: Journal
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 24 (2) Sequence Number: - Start / End Page: 247 - 265 Identifier: ISSN: 0097-5397