Partitioning Sparse Matrices with Eigenvectors of Graphs

Type: Article

Publication Date: 1990-07-01

Citations: 1683

DOI: https://doi.org/10.1137/0611030

Locations

  • SIAM Journal on Matrix Analysis and Applications - View

Similar Works

Action Title Year Authors
+ Parallel solutions for large-scale eigenvalue problems arising in graph analytics 2017 Alexandre Fender
+ Partitioning Sparse Graphs using the Second Eigenvector of their Graph Laplacian 2000 David De Wit
+ Stochastic Parallelizable Eigengap Dilation for Large Graph Clustering 2022 Elise van der Pol
Ian Gemp
Yoram Bachrach
Richard Everett
+ On the Quality of Spectral Separators 1998 Stephen Guattery
Gary L. Miller
+ Matrix algorithms and graph partitioning 2010 M. E. J. Newman
+ Partitioning Networks by Eigenvectors 2004 Andrew Seary
William D. Richards
+ A Local Clustering Algorithm for Massive Graphs and its Application to Nearly-Linear Time Graph Partitioning 2008 Daniel A. Spielman
Shang‐Hua Teng
+ Spectral Algorithms for Ordering Sparse Matrices in Parallel 1989 Alex Pothen
Horst D. Simon
+ On the complexity of partitioning sparse matrix representations 1984 J. Malmquist
Edward L. Robertson
+ PDF Chat A Local Clustering Algorithm for Massive Graphs and Its Application to Nearly Linear Time Graph Partitioning 2013 Daniel A. Spielman
Shang‐Hua Teng
+ PDF Chat Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems 2004 Daniel A. Spielman
Shang‐Hua Teng
+ Algorithm Design Using Spectral Graph Theory 2013 Richard Peng
+ A general theorem for adjacency matrices of graph products and application in graph partitioning for parallel computing 2008 A. Kaveh
Babak Alinejad
+ PDF Chat Spectral sparsification of graphs 2013 Joshua Batson
Daniel A. Spielman
Nikhil Srivastava
Shang‐Hua Teng
+ Solving Graph Laplacian Systems Through Recursive Partitioning and Two-Grid Preconditioning 2017 Colin Ponce
Panayot S. Vassilevski
+ PDF Chat Graph Partitioning and Eigenvalue Problems 2014 Tatsuro Kawamoto
+ The Laplacian Paradigm: Emerging Algorithms for Massive Graphs 2010 Shang‐Hua Teng
+ Graph Partitioning and Clustering 2021 K. Erciyes
+ Solving Large Top-K Graph Eigenproblems with a Memory and Compute-optimized FPGA Design 2021 Francesco Sgherzi
Alberto Parravicini
Marco Siracusa
Marco D. Santambrogio
+ Solving Large Top-K Graph Eigenproblems with a Memory and Compute-optimized FPGA Design 2021 Francesco Sgherzi
Alberto Parravicini
Marco Siracusa
Marco D. Santambrogio