Determinant-Preserving Sparsification of SDDM Matrices
SIAM Journal on Computing, 2020.
We show that variants of spectral sparsification routines can preserve the total spanning tree counts of graphs. By Kirchhoffu0027s matrix-tree theorem, this is equivalent to preserving the determinant...
Full Text (Upload PDF)
PPT (Upload PPT)