A Framework for Analyzing Resparsification Algorithms

SODA, 2017.

Cited by: 26|Bibtex|Views10
EI
Other Links: dblp.uni-trier.de|dl.acm.org|academic.microsoft.com|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