Graph Sparsification by Edge-Connectivity and Random Spanning Trees

Details Graph Sparsification by Edge-Connectivity and Random Spanning Trees Graph Sparsification by Edge-Connectivity and Random Spanning Trees

2010-05-03

arxiv.org/abs/1005.0265v2

Computer Science

Data Structures and Algorithms

Scientific paper

We present new approaches to constructing graph sparsifiers --- weighted subgraphs for which every cut has the same value as the original graph, up to a factor of $(1 \pm \epsilon)$. Our first approach independently samples each edge $uv$ with probability inversely proportional to the edge-connectivity between $u$ and $v$. The fact that this approach produces a sparsifier resolves a question posed by Bencz\'ur and Karger (2002). Concurrent work of Hariharan and Panigrahi also resolves this question. Our second approach constructs a sparsifier by forming the union of several uniformly random spanning trees. Both of our approaches produce sparsifiers with $O(n \log^2(n)/\epsilon^2)$ edges. Our proofs are based on extensions of Karger's contraction algorithm, which may be of independent interest.

Affiliated with

Also associated with

No associations

Rating

Graph Sparsification by Edge-Connectivity and Random Spanning Trees does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Graph Sparsification by Edge-Connectivity and Random Spanning Trees, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Graph Sparsification by Edge-Connectivity and Random Spanning Trees will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-658498