Generating Random Spanning Trees via Fast Matrix Multiplication

DOI10.1007/978-3-662-49529-2_39zbMath1475.68245OpenAlexW2500625161MaRDI QIDQ2802966

Keyulu Xu, Nicholas J. A. Harvey

Publication date: 3 May 2016

Published in: LATIN 2016: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-49529-2_39

zbMATH Keywords

spectral graph theoryfast matrix multiplicationLaplacian matricesuniform spanning trees

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (1)

Determinant-Preserving Sparsification of SDDM Matrices

This page was built for publication: Generating Random Spanning Trees via Fast Matrix Multiplication