Linking and Cutting Spanning Trees

• Type: Article in International Scientific Journal
• Date: 2018

Authors

Russo, LMS (Author) Other; Teixeira, AS (Author) Other; Francisco, AP (Author) Other

Journal

Title: Algorithms

Vol. 11

Final page: 53

ISSN: 1999-4893

Publisher: MDPI

Indexing

ISI Web of Knowledge - 2 Citations

Scopus - 3 Citations

Other information

Authenticus ID: P-00Q-WXH

DOI: 10.3390/a11040053

Abstract (EN): 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.

Language: English

Type (Professor's evaluation): Scientific

No. of pages: 34