REFERENCES
- G J Minty, A simple algorithm for listing all the spanning trees of a graph, IEEE Trans Circuit Theory, vol CT-12, p 120, 1965.
- R C Read & R E Tarjan, Bounds on backtrack algorithm for listing cycles, paths and spanning trees, Networks, vol 5, pp 237–252, 1975.
- H N Gabow & E W Myers, Finding all spanning trees of a directed and undirected graphs, SIAM J Comput, vol 7, pp 280–287, 1978.
- M N S Swamy & K Thulasiraman, Graphs, Networks and Algorithm, Wiley-Inter science, New York, 1981.
- J P Char, Generation of Trees, two-trees and storage of master forests, IEEE Trans Circuit Theory, vol CT-15, pp 128–138, 1968.
- R Jayakumar, Analysis and study of spanning tree enumeration algorithm, M S Thesis, Deptt of Comp Science, Indian Institute of Technology, Madras, India, 1980. Also reported in Combinatorics and graph theory, Springer-Verlag Lecture Notes on Mathematics, (Ed SB Rao), no 885, pp 284–289, 1981.
- R Jayaraman, K Thulasiraman & M N S Swamy, Complexity of computation of a spanning tree enumeration algorithm, IEEE Trans Circuits and Systems, vol CAS-31, pp 853–860, 1984.