An almost-linear time algorithm for uniform random spanning tree generation
From MaRDI portal
Publication:5230291
DOI10.1145/3188745.3188852zbMath1428.68391arXiv1711.06455OpenAlexW2962800567MaRDI QIDQ5230291
Publication date: 22 August 2019
Published in: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1711.06455
Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Randomized algorithms (68W20) Signed and weighted graphs (05C22) Random walks on graphs (05C81)
Related Items (7)
A Spectral Approach to Network Design ⋮ Models of random subtrees of a graph ⋮ On a wider class of prior distributions for graphical models ⋮ Determinant-Preserving Sparsification of SDDM Matrices ⋮ Unnamed Item ⋮ Approximation of the Diagonal of a Laplacian’s Pseudoinverse for Complex Network Analysis ⋮ A queueing network-based distributed Laplacian solver
This page was built for publication: An almost-linear time algorithm for uniform random spanning tree generation
