An algorithm for enumerating all spanning trees of a directed graph

Algorithmica (New York)

Volumn 27, Issue 2, 2000, Pages 120-130

  Kapoor, S ^a   Ramesh, H ^b  

^a INDIAN INSTITUTE OF TECHNOLOGY DELHI   (India)

^b INDIAN INSTITUTE OF SCIENCE   (India)

Author keywords

Directed graph; Enumeration; Spanning tree

Indexed keywords

EID: 8444242925     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004530010008     Document Type: Article

References (5)

1. H. N. Gabow and E. W. Myers: Finding all spanning trees of directed and undirected graphs, SIAM J. Comput., Vol. 7, No. 3, 1978.
2. S. Kapoor, V. Kumar, and H. Ramesh: An algorithm for generating all spanning trees of directed graphs, Proceedings of the Workshop on Algorithms and Data Structures, LNCS, Vol. 955, Springer-Verlag, Berlin, pp. 428-439, 1995.
3. S. Kapoor and H. Ramesh: Algorithms for generating all spanning trees of undirected and weighted graphs, SIAM J. Comput., Vol. 24, No. 2, 1995.
4. W. Mayeda: Graph Theory, Wiley, New York, 1972.
5. S. Shinoda: Finding all possible directed trees of a directed graph. Electron Comm. Japan, Vol. 51-A, pp. 45-47, 1968.