Techniques by compound branch and network ripping to find out all spanning trees of an undirected graph
Yin Zong-mou · Journal of Naval University of Engineering · 2004
The techniques of compoundbranch and network ripping are employed to find out all spanning trees of an undirected graph. The concept, expression and operation rules ofcompound branches are given, and the algorithm to obtain all spanning trees of a graph from those ripped sub-graphs is presented. Because of making use of some parallel algorithms, the computing complexity is reduced.