Skip to main content
Article thumbnail
Location of Repository

Subgraph Sparsification and Nearly Optimal Ultrasparsifiers

By Alexandra Kolla, Yury Makarychev, Amin Saberi and Shang-hua Teng


We consider a variation of the spectral sparsification problem where we are required to keep a subgraph of the original graph. Formally, given a union of two weighted graphs G and W and an integer k, we are asked to find a k-edge weighted graph Wk such that G + Wk is a good spectral sparsifer of G + W. We will refer to this problem as the subgraph (spectral) sparsification. We present a nontrivial condition on G and W such that a good sparsifier exists and give a polynomial-time algorithm to find the sparsifer. As a significant application of our technique, we show that for each positive integer k, every n-vertex weighted graph has an (n − 1 + k)-edge spectral sparsifier with relative condition number at most n log n Õ(log log n) where Õ() hides k lower order terms. Our bound nearly settles a question left open by Spielman and Teng about ultrasparsifiers, which is a key component in their nearly linear-time algorithms for solving diagonally dominant symmetric linear systems. We also present another application of our technique to spectral optimization in which the goal is to maximize the algebraic connectivity of a graph (e.g. turn it into an expander) with a limited number of edges

Topics: Algorithms, Theory Keywords Graph spar
Year: 2010
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.