Determinant-Preserving Sparsification of SDDM Matrices with Applications to Counting and Sampling Spanning Trees.
David DurfeeJohn PeeblesRichard PengAnup B. RaoPublished in: CoRR (2017)
Keyphrases
- spanning tree
- edge disjoint
- minimum cost
- minimum spanning tree
- minimum spanning trees
- low rank approximation
- random sampling
- depth first search
- singular value decomposition
- undirected graph
- root node
- sampling strategy
- sampling algorithm
- weighted graph
- least squares
- special case
- pairwise comparison
- parameter space
- monte carlo
- image restoration
- minimum total cost