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

Keywords

Laplacian matrix, Eigenvalues and eigenvectors, Mathematics, Spectral graph theory, Combinatorics

References

Cited by

Related papers