Edge-disjoint spanning trees and depth-first search

SummaryThis paper presents an algorithm for finding two edge-disjoint spanning trees rooted at a fixed vertex of a directed graph. The algorithm uses depthfirst search and an efficient method for computing disjoint set unions. It requires O (eα(e, n)) time and O(e) space to analyze a graph with n vertices and e edges, where α (e, n) is a very slowly growing function related to a functional inverse of Ackermann's function.

[1]  Eugene L. Lawler,et al.  Matroid intersection algorithms , 1975, Math. Program..

[2]  C. Nash-Williams.  Edge-disjoint spanning trees of finite graphs , 1961 .

[3]  C. Nash-Williams.  Decomposition of Finite Graphs Into Forests , 1964 .

[4]  J. Edmonds.  Minimum partition of a matroid into independent subsets , 1965 .

[5]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[6]  Y. Kajitani,et al.  Maximally Distant Trees and Principal Partition of a Linear Graph , 1969 .

[7]  H. Watanabe,et al.  Topological degrees of freedom and mixed analysis of electrical networks , 1970 .

[8]  Jack Edmonds,et al.  Submodular Functions, Matroids, and Certain Polyhedra , 2001, Combinatorial Optimization.

[9]  Stephen M. Chase,et al.  An implemented graph algorithm for winning Shannon Switching Games , 1972, CACM.

[10]  Donald E. Knuth,et al.  The Art of Computer Programming, Vol. 3: Sorting and Searching , 1974 .

[11]  Robert E. Tarjan,et al.  Testing flow graph reducibility , 1973, J. Comput. Syst. Sci..

[12]  Robert E. Tarjan,et al.  Finding Dominators in Directed Graphs , 1974, SIAM J. Comput..

[13]  Robert E. Tarjan,et al.  Efficiency of a Good But Not Linear Set Union Algorithm , 1972, JACM.

[14]  Alfred V. Aho,et al.  On Finding Lowest Common Ancestors in Trees , 1976, SIAM J. Comput..

[15]  W. T. Tutte.  On the Problem of Decomposing a Graph into n Connected Factors , 1961 .

[16]  Tiko Kameda,et al.  Efficient Algorithms for Determining an Extremal Tree of a Graph (Extended Abstract) , 1973, SWAT.

[17]  Robert E. Tarjan,et al.  A Good Algorithm for Edge-Disjoint Branching , 1974, Inf. Process. Lett..

[18]  Jeffrey D. Ullman,et al.  Set Merging Algorithms , 1973, SIAM J. Comput..

[19]  Alfred Lehman,et al.  A Solution of the Shannon Switching Game , 1964 .

[20]  Robert E. Tarjan,et al.  A New Algorithm for Finding Weak Components , 1974, Inf. Process. Lett..

[21]  Robert E. Tarjan,et al.  Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..