Algorithms for generating all possible spanning trees of a simple undirected connected graph: an extensive review

AbstractGeneration of all possible spanning trees of a graph is a major area of research in graph theory as the number of spanning trees of a graph increases exponentially with graph size. Several algorithms of varying efficiency have been developed since early 1960s by researchers around the globe. This article is an exhaustive literature survey on these algorithms, assuming the input to be a simple undirected connected graph of finite order, and contains detailed analysis and comparisons in both theoretical and experimental behavior of these algorithms.

[1]  H. Trent.  A NOTE ON THE ENUMERATION AND LISTING OF ALL POSSIBLE TREES IN A CONNECTED LINEAR GRAPH. , 1954, Proceedings of the National Academy of Sciences of the United States of America.

[2]  S. L. Hakimi,et al.  On trees of a graph and their generation , 1961 .

[3]  G. Minty,et al.  A Simple Algorithm for Listing All the Trees of a Graph , 1965 .

[4]  W. Mayeda,et al.  Generation of Trees without Duplications , 1965 .

[5]  I. Berger.  The Enumeration of Trees without Duplication , 1967 .

[6]  J. Char.  Generation of Trees, Two-Trees, and Storage of Master Forests , 1968 .

[7]  M. Douglas McIlroy.  Algorithm 354: generator of spanning trees [H] , 1969, CACM.

[8]  Narsingh Deo,et al.  Graph Theory with Applications to Engineering and Computer Science , 1975, Networks.

[9]  Eugene W. Myers,et al.  Finding All Spanning Trees of Directed and Undirected Graphs , 1978, SIAM J. Comput..

[10]  Amitava Rakshit,et al.  An Efficient Tree-Generation Algorithm , 1981 .

[11]  K. Thulasiraman,et al.  Complexity of computation of a spanning tree enumeration algorithm , 1984 .

[12]  Pawel Winter.  An algorithm for the enumeration of spanning trees , 1986, BIT Comput. Sci. Sect..

[13]  K. Thulasiraman,et al.  MOD-CHAR: an implementation of Char's spanning tree enumeration algorithm and its complexity analysis , 1989 .

[14]  Akihisa Tamura,et al.  EFFICIENTLY SCANNING ALL SPANNING TREES OF AN UNDIRECTED GRAPH , 1993 .

[15]  Sanjiv Kapoor,et al.  Algorithms for Enumerating All Spanning Trees of Undirected and Weighted Graphs , 1995, SIAM J. Comput..

[16]  Tomomi Matsui.  A Flexible Algorithm for Generating All the Spanning Trees in Undirected Graphs , 1997, Algorithmica.

[17]  Takeaki Uno,et al.  An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs , 1997, SIAM J. Comput..

[18]  Samar Sen Sarma,et al.  Generation of All Spanning Trees , 2009 .

[19]  Samar Sen Sarma,et al.  Generation of All Spanning Trees in the Limelight , 2012 .