An algorithm for enumerating all directed spanning trees in a directed graph
A directed spanning tree in a directed graph G=(V, A) is a spanning tree such that no two arcs share their tails. In this paper, we propose an algorithm for listing all directed spanning trees of G. Its time and space complexities are O(¦A¦+ND(¦V¦, ¦A¦)) and O(¦A¦+DS(¦V¦, ¦A¦)), where D(¦V¦, ¦A¦) and DS(¦V¦, ¦A¦) are the time and space complexities of the data structure for updating the minimum spanning tree in an undirected graph with ¦V¦ vertices and ¦A¦ edges. Here N denotes the number of directed spanning trees in G.
Keywordsdirected spanning tree listing enumerating algorithm
Unable to display preview. Download preview PDF.
- 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.Google Scholar
- A. Shioura, A. Tamura and T. Uno, “An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs”, SIAM J. Comp., to be appeared.Google Scholar
- D. Eppstein, Z. Galil, G. F. Italiano and A. Nissenzweig, “Sparsification — A Technique for Speeding up Dynamic Graph Algorithms”, FOCS 33, 60–69, 1992.Google Scholar