Spectral sparsification of graphs: theory and algorithms
Commun. ACM, pp. 87-94, 2013.
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
Full Text (Upload PDF)
PPT (Upload PPT)