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...
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: | |
Online Access: | http://www.mdpi.com/1999-4893/11/4/53 |
Similar Items
-
PENGGUNAAN METODE CUTTING PLANE UNTUK MENYELESAIKAN MINIMUM SPANNING TREE DENGAN KENDALA BOBOT PADA GRAF K_n
by: Dewi Suhika, et al.
Published: (2018-06-01) -
The Spanning Tree of a Divisible Multiple Graph
by: Alexander V. Smirnov
Published: (2018-08-01) -
Spanning Trees of Certain Types
by: Jayasooriya Arachchilage, Dinush Lanka Panditharathna
Published: (2016) -
Completely Independent Spanning Trees in (Partial) k-Trees
by: Matsushita Masayoshi, et al.
Published: (2015-08-01) -
NP-completeness of the Minimum Spanning Tree Problem of a Multiple Graph of Multiplicity k ≥ 3
by: Alexander Valeryevich Smirnov
Published: (2021-03-01)