A framework for analyzing resparsification algorithms

SODA '17: Symposium on Discrete Algorithms Barcelona Spain January, 2017, pp. 2032-2043, 2017.

Cited by: 21|Bibtex|Views9|DOI:https://doi.org/10.5555/3039686.3039818
EI
Other Links: dl.acm.org|arxiv.org

Abstract:

A spectral sparsifier of a graph G is a sparser graph H that approximately preserves the quadratic form of G, i.e., for all vectors x, xTLGx ≈ xTLHx, where LG and LH denote the respective graph Laplacians. Spectral sparsifiers generalize cut sparsifiers, and have found many applications in designing graph algorithms. In recent years, ther...More

Code:

Data:

Your rating :
0

 

Tags
Comments