A framework for analyzing resparsification algorithms
SODA '17: Symposium on Discrete Algorithms Barcelona Spain January, 2017, pp. 2032-2043, 2017.
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
Full Text (Upload PDF)
PPT (Upload PPT)