PARTITIONING SPARSE MATRICES WITH EIGENVECTORS OF GRAPHS*
Explore this paper's citation graph
Summary
It is shown that lower bounds on separator sizes can be obtained in terms of the eigenvalues of the Laplacian matrix associated with a graph, which can be used to compute good separators in grid graphs.
- Type
- article
- Published
- 1990-05-01
- Cited by
- 1,901
- References
- 15
- OpenAlex
- https://openalex.org/W2114030927
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:8978853
Keywords
Laplacian matrix, Eigenvalues and eigenvectors, Mathematics, Spectral graph theory, Combinatorics
References
- Algebraic Graph Theory: COLOURING PROBLEMS
- Algebraic connectivity of graphs
- The variation of the spectrum of a normal matrix
- Modern Error Analysis
- Time Bounds for Selection
- Lower bounds for the partitioning of graphs
- Nested Dissection of a Regular Finite Element Mesh
- An efficient heuristic procedure for partitioning graphs
- A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs
- An n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs
- The Symmetric Eigenvalue Problem
- Combinatorial optimization: networks and matroids
- λ1, Isoperimetric inequalities for graphs, and superconcentrators
- The Symmetric Eigenvalue Problem
- THE IMPLEMENTATION OF A BLOCK LANCZOS ALGORITHM WITH REORTHOGONALIZATION METHODS
Cited by
- A simple and exact Laplacian clustering of complex networking phenomena: Application to gene expression profiles
- THE EVOLUTION OF GENERALIZED RECIPROCITY ON SOCIAL INTERACTION NETWORKS
- Graph partitioning techniques for Markov Decision Processes decomposition
- Thinking project management in the age of complexity : particular implications on project risk management
- Analysis and design of scalable parallel algorithms for scientific computing
- Game Theoretic Iterative Partitioning for Dynamic Load Balancing in Distributed Network Simulation
- A discrete graph Laplacian for signal processing
- Power-laws and spectral analysis of the Internet topology
- New advances in the modeling of high-temperature superconductors
- Efficient High-Order Accurate Methods using Unstructured Grids for Hydrodynamics and Acoustics
- Algorithms in supertree inference and phylogenetic data mining
- A Novel Coarsening Method for Scalable and Efficient Mesh Generation
- Complexities of Using Graph Partitioning in Modern Scientific Problems and Application to Power System Islanding
- Parallel Simultaneous Alignment of a Large Number of Range Images on Distributed Memory System
- A MinMaxCut Spectral Method for Data Clustering and Graph Partitioning
- Weakly supervised graph-based methods for classification
- Automated Parallel Solution of Unstructured PDE Problems
- Network analysis of a tourism destination
- Parallel processing for nonlinear dynamics simulations of structures including rotating bladed-disk assemblies
- Probabilistic Analysis of the Median Rule: Asymptotics and Applications
Related papers
- Performance Analysis of Graph Laplacian Matrices in Detecting Protein Complexes
- New bounds for Laplacian energy
- The deformed consensus protocol
- Resistance distance and the normalized Laplacian spectrum
- Information Propagation Analysis of Social Network Using the Universality of Random Matrix
- Graph Spectra for Complex Networks
- The prediction of eigenvalues of the normalized laplacian matrix for image registration