Spectral sparsification of graphs: theory and algorithms

Commun. ACM, pp. 87-94, 2013.

Cited by: 97|Bibtex|Views36|DOI:https://doi.org/10.1145/2492007.2492029
EI
Other Links: dl.acm.org|dblp.uni-trier.de|academic.microsoft.com

Abstract:

Graph sparsification is the approximation of an arbitrary graph by a sparse graph. We explain what it means for one graph to be a spectral approximation of another and review the development of algorithms for spectral sparsification. In addition to being an interesting concept, spectral sparsification has been an important tool in the des...More

Code:

Data:

Your rating :
0

 

Tags
Comments