Fetching the paper…
Reading the bibliography…
This paper proposes a scalable algorithmic framework for spectral reduction of large undirected graphs.
An efficient heuristic procedure for partitioning graphs
B. W. Kernighan and S. Lin · 1970
Earlier work this paper cites.
Algorithms for partitioning of graphs and computer logic based on eigenvectors of connections matrices
W. Donath and A. Hoffman · 1972
Earlier work this paper cites.
Algebraic connectivity of graphs
M. Fiedler · 1973
Earlier work this paper cites.
A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory
M. Fiedler · 1975
Earlier work this paper cites.
Matrix analysis
R. A. Horn, R. A. Horn, and C. R. Johnson · 1990
Earlier work this paper cites.
Ratio cut partitioning for hierarchical designs
Y.-C. Wei and C.-K. Cheng · 1991
Earlier work this paper cites.
Metis–unstructured graph partitioning and sparse matrix ordering system, version 2.0
G. Karypis and V. Kumar · 1995
Earlier work this paper cites.
Approximating st minimum cuts in õ (n 2) time
A. A. Benczúr and D. R. Karger · 1996
Earlier work this paper cites.
Arpack users’ guide: Solution of large scale eigenvalue problems with implicitly restarted arnoldi methods
R. Lehoucq, D. Sorensen, and C. Yang · 1997
Earlier work this paper cites.
A fast and high quality multilevel scheme for partitioning irregular graphs
G. Karypis and V. Kumar · 1998
Earlier work this paper cites.
A multigrid tutorial
W. L. Briggs, S. F. McCormick, et al · 2000
Earlier work this paper cites.
Normalized cuts and image segmentation
J. Shi and J. Malik · 2000
Earlier work this paper cites.
Lower bounds for the partitioning of graphs
W. E. Donath and A. J. Hoffman · 2003
Earlier work this paper cites.
On spectral graph drawing
Y. Koren · 2003
Earlier work this paper cites.
Iterative methods for sparse linear systems
Y. Saad · 2003
Earlier work this paper cites.
Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
D. Spielman and S. Teng · 2004
Earlier work this paper cites.
k-means++: The advantages of careful seeding
D. Arthur and S. Vassilvitskii · 2007
Earlier work this paper cites.
A tutorial on spectral clustering
U. Von Luxburg · 2007
Earlier work this paper cites.
Visualizing data using t-sne
L. v. d. Maaten and G. Hinton · 2008
Earlier work this paper cites.
A note on preconditioning by low-stretch spanning trees
D. A. Spielman and J. Woo · 2009
Cited alongside, same era.
Numerical solution of eigenvalue problems with spectral transformations
F. Xue · 2009
Cited alongside, same era.
Subgraph sparsification and nearly optimal ultrasparsifiers
A. Kolla, Y. Makarychev, A. Saberi, and S. Teng · 2010
Cited alongside, same era.
Approaching Optimality for Solving SDD Linear Systems
I. Koutis, G. Miller, and R. Peng · 2010
Cited alongside, same era.
Algorithms, graph theory, and linear equations in laplacian matrices
D. A. Spielman · 2010
Cited alongside, same era.
Algebraic distance on graphs
J. Chen and I. Safro · 2011
Cited alongside, same era.
Benchmarking for graph clustering and partitioning
D. A. Bader, H. Meyerhenke, P. Sanders, C. Schulz, A. Kappes, and D. Wagner · 2014
Later among the works it cites.
Multiway spectral partitioning and higher-order cheeger inequalities
J. R. Lee, S. O. Gharan, and L. Trevisan · 2014
Later among the works it cites.
Nearly linear time algorithms for preconditioning and solving symmetric, diagonally dominant linear systems
D. Spielman and S. Teng · 2014
Later among the works it cites.
Accelerating t-sne using tree-based algorithms
L. Van Der Maaten · 2014
Later among the works it cites.
P. Kolev and K. Mehlhorn · 2015
Later among the works it cites.
Partitioning well-clustered graphs: Spectral clustering works
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs
P. Christiano, J. Kelner, A. Madry, D. Spielman, and S. Teng · 2011
Cited alongside, same era.
The university of florida sparse matrix collection
T. Davis and Y. Hu · 2011
Cited alongside, same era.
A general framework for graph sparsification
W. Fung, R. Hariharan, N. Harvey, and D. Panigrahi · 2011
Cited alongside, same era.
Using graph theory to analyze biological networks
G. A. Pavlopoulos, M. Secrier, C. N. Moschopoulos, T. G. Soldatos, S. Kossida, J. Aerts, R. Schneider, and P. G. Bagos · 2011
Cited alongside, same era.
Graph sparsification by effective resistances
D. A. Spielman and N. Srivastava · 2011
Cited alongside, same era.
Spectral sparsification of graphs
D. A. Spielman and S.-H. Teng · 2011
Cited alongside, same era.
R. Peng, H. Sun, and L. Zanetti · 2015
Later among the works it cites.
Recent advances in graph partitioning
A. Buluç, H. Meyerhenke, I. Safro, P. Sanders, and C. Schulz · 2016
Later among the works it cites.
Convolutional neural networks on graphs with fast localized spectral filtering
M. Defferrard, X. Bresson, and P. Vandergheynst · 2016
Later among the works it cites.
Spectral graph sparsification in nearly-linear time leveraging efficient spectral perturbation analysis
Z. Feng · 2016
Later among the works it cites.
Parallel spectral graph partitioning
M. Naumov and T. Moon · 2016
Later among the works it cites.
Scalable algorithms for data and network analysis
S.-H. Teng · 2016
Later among the works it cites.
Almost-linear-time algorithms for markov chains and new spectral primitives for directed graphs
M. B. Cohen, J. Kelner, J. Peebles, R. Peng, A. B. Rao, A. Sidford, and A. Vladu · 2017
Later among the works it cites.
An SDP-based Algorithm for Linear-sized Spectral Sparsification
Y. T. Lee and H. Sun · 2017
Later among the works it cites.
Clustering with t-sne, provably
G. C. Linderman and S. Steinerberger · 2017
Later among the works it cites.
A spectral graph sparsification approach to scalable vectorless power grid integrity verification
Z. Zhao and Z. Feng · 2017
Later among the works it cites.
SAMG: Sparsified graph theoretic algebraic multigrid for solving large symmetric diagonally dominant (SDD) matrices
Z. Zhao, Y. Wang, and Z. Feng · 2017
Later among the works it cites.
Similarity-aware spectral sparsification by edge filtering
Z. Feng · 2018
Closest in time.
Spectrally approximating large graphs with smaller graphs
A. Loukas and P. Vandergheynst · 2018
Closest in time.