An algorithm for enumerating all directed spanning trees in a directed graph

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1178, Issue , 1996, Pages 167-173

  Takeaki, U N O ^a  

^a TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

Directed spanning tree; Enumerating algorithm; Listing

Indexed keywords

DIRECTED GRAPHS; GRAPH THEORY; TELECOMMUNICATION NETWORKS;

DIRECTED SPANNING TREES; LISTING; MINIMUM SPANNING TREES; SPANNING TREE; TIME AND SPACE COMPLEXITY; UNDIRECTED GRAPH;

TREES (MATHEMATICS);

EID: 84990188207     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (7)

1. H. N. Gabow, E. W. Myers, “Finding All Spanning Trees of Directed and Undirected Graphs,” SIAM J. Comp., 7, 280-287, 1978.
2. H. N. Kapoor and H. Ramesh, “Algorithms for Generating All Spanning Trees of Undirected, Directed and .Weighted Graphs,” Lecture Notes in Computer Science, Springer-Verlag, 461-472, 1992.
3. A. Shioura, A. Tamura and T. Uno, “An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs,” SIAM J. Comp., to be appeared.
4. D. Eppstein, Z. Galil, G. F. Italiano and A. Nissenzweig, “Sparsification - A Technique for Speeding up Dynamic Graph Algorithms, “ FOCS 33, 60-69, 1992.
5. G. N. Fedrickson, “Data Structure for On-line Updating of Minimum Spanning Trees, with Applications, “ SIAM J. Comp., 14, No 4, 781-798, 1985.
6. D. D. Sleator and R. E. Tarjan, “A Data Structure for Dynamic Trees,” J. Comp. Sys. Sci. 26, 362-391, 1983.
7. R. E. Tarjan, “Depth-First Search and Linear Graph Algorithm,” SIAM J. Comp. 1, 146-169, 1972.