Twice-Ramanujan Sparsifiers

SIAM Review, pp. 315-334, 2014.

Cited by: 310|Bibtex|Views22|DOI:https://doi.org/10.1145/1536414.1536451
EI
Other Links: dl.acm.org|dblp.uni-trier.de|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, we...More

Code:

Data:

Full Text
Your rating :
0

 

Tags
Comments