Login / Signup
Sampling Random Spanning Trees Faster than Matrix Multiplication.
David Durfee
Rasmus Kyng
John Peebles
Anup B. Rao
Sushant Sachdeva
Published in:
CoRR (2016)
Keyphrases
</>
spanning tree
matrix multiplication
edge disjoint
minimum spanning tree
minimum spanning trees
message passing
minimum cost
sampled data
distributed memory
random sampling
matrix factorization
image processing
weighted graph
edge weights
highly efficient
graph theory
worst case
high resolution