Fetching the paper…
Reading the bibliography…
A spectral sparsifier of a graph $G$ is a sparser graph $H$ that approximately preserves the quadratic form of $G$, i.e.
An Introduction to Parallel Algorithms
Joseph JáJá · 1992
Earlier work this paper cites.
Introduction to Parallel Algorithms and Architectures: Array, Trees, Hypercubes
F. Thomson Leighton · 1992
Earlier work this paper cites.
Approximating s-t minimum cuts in O ( n 2 ) {O}(n^{2}) time
András A. Benczúr and David R. Karger · 1996
Earlier work this paper cites.
In James M. Abello and Jeffrey Scott Vitter, editors, External Memory Algorithms
Monika R. Henzinger, Prabhakar Raghavan, and Sridhar Rajagopalan · 1999
Earlier work this paper cites.
Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
Daniel A. Spielman and Shang-Hua Teng · 2004
Earlier work this paper cites.
On graph problems in a semi-streaming model
Joan Feigenbaum, Sampath Kannan, Andrew McGregor, Siddharth Suri, and Jian Zhang · 2005
Earlier work this paper cites.
Graph partitioning using single commodity flows
Rohit Khandekar, Satish Rao, and Umesh Vazirani · 2006
Earlier work this paper cites.
Graph sparsification by effective resistances
Daniel A. Spielman and Nikhil Srivastava · 2008
Earlier work this paper cites.
Graph sparsification in the semi-streaming model
Kook Jin Ahn and Sudipto Guha · 2009
Earlier work this paper cites.
Faster generation of random spanning trees
Jonathan A. Kelner and Aleksander Madry · 2009
Earlier work this paper cites.
A linear-time algorithm for sparsification of unweighted graphs
Ramesh Hariharan and Debmalya Panigrahi · 2010
Earlier work this paper cites.
A general framework for graph sparsification
Wai Shing Fung, Ramesh Hariharan, Nicholas J.A. Harvey, and Debmalya Panigrahi · 2011
Earlier work this paper cites.
A nearly- m log n m\log n time solver for SDD linear systems
Ioannis Koutis, Gary L. Miller, and Richard Peng · 2011
Earlier work this paper cites.
Towards an SDP-based approach to spectral methods: a nearly-linear-time algorithm for graph partitioning and decomposition
Lorenzo Orecchia and Nisheeth K. Vishnoi · 2011
Earlier work this paper cites.
Spectral sparsification of graphs
D. Spielman and S. Teng · 2011
Cited alongside, same era.
Freedman’s inequality for matrix martingales
Joel Tropp · 2011
Cited alongside, same era.
Twice-Ramanujan sparsifiers
Joshua Batson, Daniel A Spielman, and Nikhil Srivastava · 2012
Cited alongside, same era.
Faster approximate multicommodity flow using quadratically coupled flows
Jonathan A. Kelner, Gary L. Miller, and Richard Peng · 2012
Cited alongside, same era.
Spectral sparsification via random spanners
Michael Kapralov and Rina Panigrahy · 2012
Cited alongside, same era.
Approximating the exponential, the Lanczos method and an Õ(m)-time spectral algorithm for balanced separator
Lorenzo Orecchia, Sushant Sachdeva, and Nisheeth K. Vishnoi · 2012
Cited alongside, same era.
Efficient sampling for Gaussian graphical models via spectral sparsification
Dehua Cheng, Yu Cheng, Yan Liu, Richard Peng, and Shang-Hua Teng · 2015
Later among the works it cites.
Faster spectral sparsification of laplacian and SDDM matrix polynomials
Gorav Jindal and Pavel Kolev · 2015
Later among the works it cites.
Fast augmenting paths by random sampling from residual graphs
David R. Karger and Matthew S. Levine · 2015
Later among the works it cites.
Faster spectral sparsification and numerical algorithms for SDD matrices
Ioannis Koutis, Alex Levin, and Richard Peng · 2015
Later among the works it cites.
Fast, provable algorithms for isotonic regression in all ℓ p \ell_{p} -norms
Rasmus Kyng, Anup Rao, and Sushant Sachdeva · 2015
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
User-friendly tail bounds for sums of random matrices
Joel A. Tropp · 2012
Cited alongside, same era.
Efficient preconditioning of laplacian matrices for computer graphics
Dilip Krishnan, Raanan Fattal, and Richard Szeliski · 2013
Cited alongside, same era.
Spectral sparsification in the semi-streaming setting
Jonathan A. Kelner and Alex Levin · 2013
Cited alongside, same era.
Parallel graph decompositions using random shifts
Gary L. Miller, Richard Peng, and Shen Chen Xu · 2013
Cited alongside, same era.
Algorithm Design Using Spectral Graph Theory
Richard Peng · 2013
Cited alongside, same era.
Constant arboricity spectral sparsifiers
Timothy Chu, Michael B. Cohen, Jakub W. Pachocki, and Richard Peng · 2014
Cited alongside, same era.
Yin Tat Lee and He Sun · 2015
Later among the works it cites.
Spanning edge centrality: Large-scale computation and applications
Charalampos Mavroforakis, Richard Garcia-Lebron, Ioannis Koutis, and Evimaria Terzi · 2015
Later among the works it cites.
Improved parallel algorithms for spanners and hopsets
Gary L. Miller, Richard Peng, Adrian Vladu, and Shen Chen Xu · 2015
Later among the works it cites.
Alexandr Andoni, Jiecao Chen, Robert Krauthgamer, Bo Qin, David P. Woodruff, and Qin Zhang · 2016
Closest in time.
On fully dynamic graph sparsifiers
Ittai Abraham, David Durfee, Ioannis Koutis, Sebastian Krinninger, and Richard Peng · 2016
Closest in time.
Michael B. Cohen, Cameron Musco, and Jakub W. Pachocki · 2016
Closest in time.
Single-and multi-level network sparsification by algebraic distance
Emmanuel John and Ilya Safro · 2016
Closest in time.
Sparsified Cholesky and multigrid solvers for Connection Laplacians
Rasmus Kyng, Yin Tat Lee, Richard Peng, Sushant Sachdeva, and Daniel A Spielman · 2016
Closest in time.
Approximate Gaussian elimination for Laplacians: Fast, sparse, and simple
Rasmus Kyng and Sushant Sachdeva · 2016
Closest in time.