Linking and Cutting Spanning Trees

@article{Russo2018LinkingAC,
  title={Linking and Cutting Spanning Trees},
  author={Lu{\'i}s M. S. Russo and Andreia Sofia Teixeira and A. Francisco},
  journal={Algorithms},
  year={2018},
  volume={11},
  pages={53}
}
We consider the problem of uniformly generating a spanning tree, of a connected undirected graph. This process is useful to compute 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 we obtain no analytical bounds, but experimental results show that the chain still converges quickly. This yields an efficient algorithm, also due to the use… Expand
2 Citations

References

SHOWING 1-10 OF 37 REFERENCES
Generating random spanning trees
  • A. Broder
  • Mathematics, Computer Science
  • 30th Annual Symposium on Foundations of Computer Science
  • 1989
  • 351
  • Highly Influential
  • PDF
A Random Tree Model Associated with Random Graphs
  • D. Aldous
  • Mathematics, Computer Science
  • Random Struct. Algorithms
  • 1990
  • 58
  • PDF
Generating random spanning trees more quickly than the cover time
  • D. Wilson
  • Mathematics, Computer Science
  • STOC '96
  • 1996
  • 423
  • Highly Influential
  • PDF
Unranking and Ranking Spanning Trees of a Graph
  • 40
  • Highly Influential
Faster Generation of Random Spanning Trees
  • J. Kelner, A. Madry
  • Mathematics, Computer Science
  • 2009 50th Annual IEEE Symposium on Foundations of Computer Science
  • 2009
  • 90
  • PDF
The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees
  • D. Aldous
  • Mathematics, Computer Science
  • SIAM J. Discret. Math.
  • 1990
  • 269
  • PDF
Probability on Trees and Networks
  • 508
  • Highly Influential
  • PDF
Improved Bounds for Mixing Rates of Marcov Chains and Multicommodity Flow
  • A. Sinclair
  • Mathematics, Computer Science
  • Comb. Probab. Comput.
  • 1992
  • 329
  • Highly Influential
  • PDF
A data structure for dynamic trees
  • 852
  • PDF
From graphs to matrices, and back: new techniques for graph algorithms
  • 20
  • PDF
...
1
2
3
4
...