Twice-Ramanujan Sparsifiers

Siam Review, 2014.

Cited by: 276|Bibtex|Views22
Other Links: academic.microsoft.com|arxiv.org

Abstract:

We prove that every graph has a spectral sparsifier with a number of edges linear in its number of vertices. As linear-sized spectral sparsifiers of complete graphs are expanders, our sparsifiers of arbitrary graphs can be viewed as generalizations of expander graphs. In particular, we prove that for every $d>1$ and every undirected, ...More

Code:

Data:

Full Text
Your rating :
0

 

Tags
Comments