|
[1] D. Avis and K. Fukuda, “ A Basis Enumeration Algorithm for Linear Systems with Geometric Applications,” Applied Mathematics Letters, vol. 4, pp. 39-42, 1991. [2] D. Avis and K. Fukuda, “ Reverse Search for Enumeration,” Discrete Applied Mathematics, vol. 65, pp.21-46, 1996. [3] J. P. Char, “ Generation of Trees, 2 Trees and Storage of Master Forests,” IEEE Transactions on Circuit Theory, vol. 15, pp. 128-138, 1968. [4] H. N. Gabow, “ Two Algorithms for Generating Weighted Spanning Trees in Order,” SIAM Journal on Computing, vol. 6, pp. 139-150, 1977. [5] S. L. Hakimi and D. G. Green, “ Generation and Realization of Trees and k-Trees,” IEEE Transactions on Circuit Theory, vol. 11, pp. 247-255, 1964. [6] R. Jayakumar, K. Thulasiraman, and M. N. S. Swamy, “ Complexity of Computation of a Spanning Tree Enumerating Algorithm,” IEEE Transactions on Circuits and Systems, vol. 31, pp. 853-860, 1984. [7] S. Kapoor and H. Ramesh, “ Algorithms for Generating All Spanning Trees of Undirected and Weighted Graph,” SIAM Journal on Computing, vol. 24, pp. 247-265, 1995. [8] S. Kapoor and H. Ramesh, “ An Algorithm for Enumerating All Spanning Trees of a Directed Graph,“ Algorithmica, vol. 27, pp. 120-130, 2000. [9] T. Matsui, “ An Algorithm for Finding All the Spanning Trees in Undirected Graph,” Research Report, Department of Mathematical Engineering and Information Physics, University of Tokyo, Tokyo, 1993. [10] W. Mayeda, Graph Theory, Wiley, New York, 1972. [11] W. Mayeda and S. Seshu, “ Generation of Trees without Duplications,” IEEE Transactions on Circuit Theory, vol. 12, pp. 181-185, 1965. [12] G. J. Minty, “ A Simple Algorithm for Listing All the Trees of a graph,” IEEE Transactions on Circuit and Systems, vol. 12, p.120, 1965. [13] E. W. Myers and H. N. Gabow, “ Finding All Spanning Trees of Directed and Undirected Graph,” SIAM Journal on Computing, vol. 7, pp. 280-287, 1978. [14] R. C. Read and R. E. Tarjan, “ Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees,” Networks, vol. 5, pp. 237-252, 1975. [15] S. Shinoda, “ Finding All Possible Directed Trees of a Directed Graph,” Electronics and Communications in Japan, vol. 51-A, pp. 45-47, 1968. [16] A. Shioura and A. Tamura, “ Efficient Scanning All Spanning Trees of an Undirected Graph,” Journal of the Operations Research Society of Japan, vol. 38, pp. 331- 344, 1995. [17] A. Shioura, A. Tamura, and T. Uno, “ An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs,” SIAM Journal on Computing, vol. 26, pp. 678-692, 1997. [18] D. D. Sleator and R. E. Tarjan, “ A Data Structure for Dynamic Trees,” Journal of Computer and System Sciences, vol. 26, pp. 362-391, 1983. [19] R. E. Tarjan, “ Depth-First Search and Linear Graph Algorithms,” SIAM Journal on Computing, vol. 1, pp.146- 160, 1972. [20] T. Uno, “ A New Approach for Speeding Up Enumeration Algorithms,” ISSAC 1998, Lecture Notes in Computer Science, vol. 1533, Springer-Verlag, pp. 287-296. [21] T. Uno, “ A New Approach for Speeding Up Enumeration Algorithm and Its Application for Matroid Bases,” COCOON 1999, Lecture Notes in Computer Science, vol. 1627, Springer-Verlag, pp. 349-359.
|