Constructing linear-sized spectral sparsification in almost-linear time
From MaRDI portal
Cited in
(5)- Spectral sparsification via bounded-independence sampling
- Better sparsifiers for directed Eulerian graphs
- Eldan's stochastic localization and the KLS conjecture: isoperimetry, concentration and mixing
- Small-space spectral sparsification via bounded-independence sampling
- Sparsification of directed graphs via cut balance
This page was built for publication: Constructing linear-sized spectral sparsification in almost-linear time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6946889)