Random spanning tree

DOI10.1016/0196-6774(83)90022-6zbMATH Open0521.68073OpenAlexW2018691712MaRDI QIDQ3670588FDOQ3670588

Authors Alain Guénoche 

Publication date 1983

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0196-6774(83)90022-6

zbMATH Keywords

polynomial algorithmrandom spanning tree

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10)

Cited In (7)

• Linking and cutting spanning trees
• Determinant-preserving sparsification of SDDM matrices
• Approximate counting, uniform generation and rapidly mixing Markov chains
• Models of random subtrees of a graph
• Generalized loop-erased random walks and approximate reachability
• A transient equivalence between Aldous-Broder and Wilson's algorithms and a two-stage framework for generating uniform spanning trees
• Perfect sampling methods for random forests

This page was built for publication: Random spanning tree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3670588)