Fetching the paper…
Reading the bibliography…
Spectral graph sparsification has emerged as a powerful tool in the analysis of large-scale networks by reducing the overall number of edges, while maintaining a comparable graph Laplacian matrix.
Fat-trees: Universal Networks for Hardware-efficient Supercomputing
C. Leiserson · 1985
Earlier work this paper cites.
Computing the cs and the generalized singular value decompositions
C. Van Loan · 1985
Earlier work this paper cites.
Graph drawing by force-directed placement
T. Fruchterman and E. Reingold · 1991
Earlier work this paper cites.
Approximating s-t minimum cuts in O ( n 2 ) {O}(n^{2}) time
A. A. Benczúr and D. R. Karger · 1996
Earlier work this paper cites.
Solving sparse, symmetric, diagonally-dominant linear systems in time O ( m 1.31 ) {O}(m^{1.31})
D. A. Spielman and S.-H. Teng · 2003
Earlier work this paper cites.
Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
D. A. Spielman and S.-H. Teng · 2004
Earlier work this paper cites.
V. A. Zorich · 2004
Earlier work this paper cites.
Nearly-linear time algorithms for preconditioning and solving symmetric, diagonally dominant linear systems
D. A. Spielman and S.-H. Teng · 2006
Cited alongside, same era.
Spectral sparsification of graphs
D. A. Spielman and S.-H. Teng · 2008
Cited alongside, same era.
Rumour spreading and graph conductance
F. Chierichetti, S. Lattanzi, and A. Panconesi · 2010
Cited alongside, same era.
Near-optimal column-based matrix reconstruction
C. Boutsidis, P. Drineas, and M. Magdon-Ismail · 2011
Cited alongside, same era.
Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs
P. Christiano, J. A. Kelner, A. Madry, D. A. Spielman, and S.-H. Teng · 2011
Cited alongside, same era.
Graph sketches: sparsification, spanners, and subgraphs
K. J. Ahn, S. Guha, and A. McGregor · 2012
Later among the works it cites.
Faster subset selection for matrices and applications
H. Avron and C. Boutsidis · 2012
Later among the works it cites.
Twice-ramanujan sparsifiers
J. D. Batson, D. A. Spielman, and N. Srivastava · 2012
Later among the works it cites.
Spectral sparsification via random spanners
M. Kapralov and R. Panigrahy · 2012
Later among the works it cites.
Spectral sparsification of graphs: theory and algorithms
J. D. Batson, D. A. Spielman, N. Srivastava, and S.-H. Teng · 2013
Later among the works it cites.
SNAP Datasets: Stanford large network dataset collection
J. Leskovec and A. Krevl · 2014
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Sparsification of influence networks
M. Mathioudakis, F. Bonchi, C. Castillo, A. Gionis, and A. Ukkonen · 2011
Cited alongside, same era.
Graph sparsification by effective resistances
D. A. Spielman and N. Srivastava · 2011
Cited alongside, same era.
Interlacing families II: Mixed characteristic polynomials and the Kadison-Singer problem
A. W. Marcus, D. A. Spielman, and N. Srivastava · 2014
Closest in time.