Linking and Cutting Spanning Trees

Linking and Cutting Spanning Trees

We 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 outperf...

Full description

Bibliographic Details
Main Authors: Luís M. S. Russo, Andreia Sofia Teixeira, Alexandre P. Francisco
Format: Article
Language:English
Published: MDPI AG 2018-04-01
Series:Algorithms
Subjects:
spanning tree
uniform generation
Markov chain
mixing time
link-cut tree
Online Access:http://www.mdpi.com/1999-4893/11/4/53

Internet

http://www.mdpi.com/1999-4893/11/4/53

Similar Items