Expanders via random spanning trees.

Navin Goyal Luis Rademacher Santosh S. Vempala

Published in: SODA (2009)

Keyphrases

spanning tree
edge disjoint
minimum spanning tree
minimum cost
minimum weight
minimum spanning trees
uniformly distributed
minimum total cost
neural network
euclidean space
undirected graph
depth first search