PARTITIONING SPARSE MATRICES WITH EIGENVECTORS OF GRAPHS*
@article{Liou1973PARTITIONINGSM,
title={PARTITIONING SPARSE MATRICES WITH EIGENVECTORS OF GRAPHS*},
author={KANG-PU Liou and A. Pothen},
journal={Ibm Journal of Research and Development},
year={1973}
}The problem ofcomputing a small vertex separator in a graph arises in the context ofcomputing a good ordering for the parallel factorization of sparse, symmetric matrices. An algebraic approach for computing vertex separators is considered in this paper. 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. The Laplacian eigenvectors of grid graphs can be computed from Kronecker products involving the… CONTINUE READING
1,769 Citations
Partitioning Sparse Graphs using the Second Eigenvector of their Graph Laplacian
- Mathematics
- 2000
- 2
- Highly Influenced
- PDF
Factorization for efficient solution of eigenproblems of adjacency and Laplacian matrices for graph products
- Mathematics
- 2008
- 23
On the performance of spectral graph partitioning methods
- Mathematics, Computer Science
- SODA '95
- 1995
- 77
- PDF
A general theorem for adjacency matrices of graph products and application in graph partitioning for parallel computing
- Mathematics
- 2009
- 8
Spectral Partitioning with Multiple Eigenvectors
- Computer Science, Mathematics
- Discret. Appl. Math.
- 1999
- 170
- PDF
A Graph Based Davidson Algorithm for the Graph Partitioning Problem
- Mathematics, Computer Science
- Int. J. Found. Comput. Sci.
- 1999
- 10
- PDF
References
SHOWING 1-10 OF 19 REFERENCES
An efficient heuristic procedure for partitioning graphs
- Mathematics, Computer Science
- Bell Syst. Tech. J.
- 1970
- 3,533
A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs
- Mathematics, Computer Science
- SWAT
- 1971
- 1,213
An n5/2 Algorithm for Maximum Matchings in Bipartite Graphs
- Mathematics, Computer Science
- SIAM J. Comput.
- 1973
- 2,427
- PDF