Next Article in Journal
Dual Market Facility Network Design under Bounded Rationality
Next Article in Special Issue
Distributed Combinatorial Maps for Parallel Mesh Processing
Previous Article in Journal
Introduction to Reconfiguration

Linking and Cutting Spanning Trees

INESC-ID and the Department of Computer Science and Engineering, Instituto Superior Técnico, Universidade de Lisboa, Avenida Rovisco Pais 1, 1049-001 Lisboa, Portugal
Author to whom correspondence should be addressed.
Algorithms 2018, 11(4), 53;
Received: 12 March 2018 / Revised: 11 April 2018 / Accepted: 11 April 2018 / Published: 19 April 2018
(This article belongs to the Special Issue Efficient Data Structures)
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 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
Keywords: spanning tree; uniform generation; Markov chain; mixing time; link-cut tree spanning tree; uniform generation; Markov chain; mixing time; link-cut tree
Show Figures

Figure 1

MDPI and ACS Style

Russo, L.M.S.; Teixeira, A.S.; Francisco, A.P. Linking and Cutting Spanning Trees. Algorithms 2018, 11, 53.

AMA Style

Russo LMS, Teixeira AS, Francisco AP. Linking and Cutting Spanning Trees. Algorithms. 2018; 11(4):53.

Chicago/Turabian Style

Russo, Luís M. S., Andreia Sofia Teixeira, and Alexandre P. Francisco. 2018. "Linking and Cutting Spanning Trees" Algorithms 11, no. 4: 53.

Find Other Styles
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

Back to TopTop