Graph Sparsification by Effective Resistances

  title={Graph Sparsification by Effective Resistances},
  author={Daniel A. Spielman and Nikhil Srivastava},
We present a nearly-linear time algorithm that produces high-quality sparsifiers of weighted graphs. Given as input a weighted graph G=(V,E,w) and a parameter ε>0, we produce a weighted subgraph H=(V,~E,~w) of G such that |~E|=O(n log n/ε<sup>2</sup>) and for all vectors x in R<sup>V</sup>. (1-ε) ∑uv ∈ E (x(u)-x(v))<sup>2</sup>w<sub>uv</sub>≤ ∑uv in ~E(x(u)-x(v))<sup>2</sup>~w<sub>uv</sub> ≤ (1+ε)∑uv ∈ E(x(u)-x(v))<sup>2</sup>w<sub>uv</sub>. This improves upon the sparsifiers constructed by… CONTINUE READING
Highly Cited
This paper has 30 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.
22 Citations
3 References
Similar Papers


Publications referenced by this paper.

Similar Papers

Loading similar papers…