mlsanityData to 7 Oct 2026

Constructing Linear-Sized Spectral Sparsification in Almost-Linear Time

arXiv 1508.03261 ↗First posted 13 Aug 2015cs.DS cs.DMcited by 17

Not on the map. Why?

Abstract (arXiv)

We present the first almost-linear time algorithm for constructing linear-sized spectral sparsification for graphs. This improves all previous constructions of linear-sized spectral sparsification, which requires Omega(n2) time. A key ingredient in our algorithm is a novel combination of two techniques used in literature for constructing spectral sparsification: Random sampling by effective resistance, and adaptive constructions based on barrier functions.

Key facts. Cited by 17 papers in the map (data through 7 Oct 2026). First posted on arXiv 13 Aug 2015.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 3; 2022: 3; 2023: 3; 2024: 5; 2025: 3.

17 papers.

Sort: