Linking and Cutting Spanning Trees
AbstractWe consider the problem of uniformly generating a spanning tree for an undirected connected graph. This process is useful for computing statistics, namely for phylogenetic trees. We describe a Markov chain for producing these trees. For cycle graphs, we prove that this approach significantly outperforms existing algorithms. For general graphs, experimental results show that the chain converges quickly. This yields an efficient algorithm due to the use of proper fast data structures. To obtain the mixing time of the chain we describe a coupling, which we analyze for cycle graphs and simulate for other graphs. View Full-Text
Share & Cite This Article
Russo, L.M.S.; Teixeira, A.S.; Francisco, A.P. Linking and Cutting Spanning Trees. Algorithms 2018, 11, 53.
Russo LMS, Teixeira AS, Francisco AP. Linking and Cutting Spanning Trees. Algorithms. 2018; 11(4):53.Chicago/Turabian Style
Russo, Luís M.S.; Teixeira, Andreia S.; Francisco, Alexandre P. 2018. "Linking and Cutting Spanning Trees." Algorithms 11, no. 4: 53.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.