An Efficient Tree-Generation Algorithm

摘要

An algorithm for generation of trees of a connected, non-oriented, and simple graph is presented in this paper. The space complexity of the algorithm is independent of the number of trees and the time complexity is drastically reduced compared to the brute-force technique. The algorithm is easily programmable. Experimental results for several graphs are presented.