Highly Influenced

# Subgraph Sparsification and Nearly Optimal Ultrasparsifiers

@inproceedings{Kolla2010SubgraphSA, title={Subgraph Sparsification and Nearly Optimal Ultrasparsifiers}, author={Alexandra Kolla and Yury Makarychev and Amin Saberi and Shang-Hua Teng}, booktitle={STOC}, year={2010} }

- Published 2010 in STOC
DOI:10.1145/1806689.1806699

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… CONTINUE READING

Highly Cited

This paper has 40 citations. REVIEW CITATIONS

#### From This Paper

##### Topics from this paper.

29 Citations

4 References

Similar Papers

#### References

##### Publications referenced by this paper.

Showing 1-4 of 4 references

Highly Influential

Highly Influential

Highly Influential

Highly Influential