Subgraph sparsification and nearly optimal ultrasparsifiers

Authors:
Alexandra Kolla;Yury Makarychev;Amin Saberi;Shang-Hua Teng
Affiliations:
IAS, Princeton, NJ, USA;TTI-C, Chicago, IL, USA;Stanford, Stanford, CA, USA;USC, Los Angeles, CA, USA
Venue:
Proceedings of the forty-second ACM symposium on Theory of computing
Year:
2010

Citing 11
Cited 3

There is a planar graph almost as good as the complete graph

SCG '86 Proceedings of the second annual symposium on Computational geometry
A Graph-Theoretic Game and its Application to the $k$-Server Problem

SIAM Journal on Computing
Approximating s-t minimum cuts in Õ(n2) time

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Matrix computations (3rd ed.)

Matrix computations (3rd ed.)
Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Lower-stretch spanning trees

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Minimizing Effective Resistance of a Graph

SIAM Review
Graph sparsification by effective resistances

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Nearly Tight Low Stretch Spanning Trees

FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Twice-ramanujan sparsifiers

Proceedings of the forty-first annual ACM symposium on Theory of computing
Maximum algebraic connectivity augmentation is NP-hard

Operations Research Letters

Gelling, and melting, large graphs by edge manipulation

Proceedings of the 21st ACM international conference on Information and knowledge management
Spectral sparsification of graphs: theory and algorithms

Communications of the ACM
An efficient graph sparsification approach to scalable harmonic balance (HB) analysis of strongly nonlinear RF circuits

Proceedings of the International Conference on Computer-Aided Design

Quantified Score

Hi-index	0.02

Visualization

Abstract

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 an 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/k log n, ~O(log log n) where ~O() hides lower order terms. Our bound nearly settles a question left open by Spielman and Teng about ultrasparsifiers. 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.