Publisher
Springer Science and Business Media LLC
Reference16 articles.
1. Aldous DJ (1990) The random walk construction of uniform spanning trees and uniform labelled trees. SIAM J Discrete Math. https://doi.org/10.1137/0403039
2. Anari N, Hu N, Saberi A, Schild A (2021) Sampling arborescences in parallel. In: Innovations in theoretical computer science
3. Bacher A, Bodini O, Hollender A, Lumbroso J (2018) Mergeshuffle: a very fast, parallel random permutation algorithm, vol 2113
4. Bourbour S, Mehta DP, Navidi WC (2020) Improved methods to compare distance metrics in networks using uniform random spanning trees (dimecost). Networks. https://doi.org/10.1002/net.21949
5. Broder A (1989) Generating random spanning trees. https://doi.org/10.1109/sfcs.1989.63516