Random spanning tree

DOI10.1016/0196-6774(83)90022-6zbMath0521.68073OpenAlexW2018691712MaRDI QIDQ3670588

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)

Related Items (6)

Approximate counting, uniform generation and rapidly mixing Markov chains ⋮ Models of random subtrees of a graph ⋮ Determinant-Preserving Sparsification of SDDM Matrices ⋮ Perfect sampling methods for random forests ⋮ Generalized loop‐erased random walks and approximate reachability ⋮ Linking and cutting spanning trees

This page was built for publication: Random spanning tree