An algorithm for the enumeration of spanning trees
- 152 Downloads
Enumeration of spanning trees of an undirected graph is one of the graph problems that has received much attention in the literature. In this paper a new enumeration algorithm based on the idea of contractions of the graph is presented. The worst-case time complexity of the algorithm isO(n+m+nt) wheren is the number of vertices,m the number of edges, andt the number of spanning trees in the graph. The worst-case space complexity of the algorithm isO(n2). Computational analysis indicates that the algorithm requires less computation time than any other of the previously best-known algorithms.
KeywordsGraph Theory Spanning Tree Enumeration Algorithm
Unable to display preview. Download preview PDF.
- 1.A. V. Aho, J. E. Hopcroft and J. U. Ullman,The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Mass. (1974).Google Scholar
- 2.J. P. Char,Generation of trees, two-trees and storage of master forests, IEEE Trans. Circuit Theory, CT-15 (1968), 128–138.Google Scholar
- 3.S. M. Chase,Analysis of algorithms for finding all spanning trees of a graph, RC3190, IBM T. J. Watson Research Center, Yorktown Heights, N.Y. (1970).Google Scholar
- 5.S. L. Hakimi and D. G. Green,Generation and realization of trees and k-trees, IEEE Trans. Circuit Theory, CT-11 (1964), 247–255.Google Scholar
- 6.F. Harary,Graph Theory, Addison-Wesley, Reading (1969).Google Scholar
- 7.R. Jayakumar and K. Thulasiram,Analysis of a spanning tree enumeration algorithm inCombinatorics and Graph Theory, Sprnger-Verlag, Lect. Notes in Mathematics Nr. 833 (1980), 284–289.Google Scholar
- 8.W. Mayeda and S. Sehu,Generation of trees without duplications, IEEE Trans. Circuit Theory, CT-12 (1965), 181–185.Google Scholar
- 9.W. Minty,A simple algorithm for listing all the trees of a graph, IEEE Trans. Circuit Theory, CT-12 (1965), 120.Google Scholar
- 10.R. C. Read and R. E. Tarjan,Bounds on backtrack algorithms for listing cycles, paths and spanning trees, Networks, 5 (1975), 237–252.Google Scholar