References
- Ahuja , R. K. , Magnanti , T. L. and Orlin , J. B. 1993 . Network Flows: Theory, Algorithms, and Applications , Englewood Cliffs, NJ : Prentice-Hall .
- Camerini , P. M. , Fratta , L. and Maffioli , F. Efficient methods for ranking trees . Proceedings of the 3rd International Symposium on Network Theory . Split, Yugoslavia. pp. 1 – 10 .
- Gabow , H. N. 1977 . Two algorithms for generating weighted spanning trees in order . SIAM J. Comput. , 6 : 139 – 150 .
- Hamacher , H. W. and Queyranne , M. 1985 . K-best solutions to combinatorial optimization problems . Ann. Oper. Res. , 4 : 123 – 143 .
- Kapoor , S. and Ramesh , H. 1995 . Algorithms for enumerating all spanning trees of undirected and weighted graphs . SIAM J. Comput. , 24 : 247 – 265 .
- Kruskal , J. B. 1956 . On the shortest spanning subtree of a graph and the traveling salesman problem . Proc. Am. Math. Soc. , 7 : 8 – 50 .
- Lawler , E. L. 1972 . A procedure for computing the K best solutions to discrete optimization problems and its application to the shortest path problem . Manag. Sci. , 18 : 401 – 405 .
- Matsui , T. 1997 . A flexible algorithm for generating all the spanning trees in undirected graphs . Algorithmica , 18 : 530 – 543 .
- Minty , G. J. 1965 . A simple algorithm for listing all the trees of a graph . IEEE Trans. Circuit Theory , CT-12 : 120
- Prim , R. C. 1957 . Shortest connection networks and some generalizations . Bell Syst. Tech. J , 36 : 1389 – 1401 .
- Read , R. C. and Tarjan , R. E. 1975 . Bounds on backtrack algorithms for listing cycles, paths, and spanning trees . Networks , 5 : 237 – 252 .
- Sedgewick , R. 1998 . Algorithms in C , 3 , Reading, MA : Addison-Wesley .
- Sörensen , K. and Janssens , G. K. 2005 . An algorithm to generate all spanning trees of a graph in order of increasing cost . Pesqui. Oper. , 25 : 219 – 229 .