The DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.
Partitioning Sparse Matrices with Eigenvectors of Graphs
Abstract
The problem of computing a small vertex separator in a graph arises in the context of computing 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 eigenvectors of path graphs, and these eigenvectors can be used to compute good separators in grid graphs. A heuristic algorithm is designed to compute a vertex separator in a general graph by first computing an edge separator in the graph from an eigenvector of the Laplacian matrix, and then using a maximum matching in a subgraph to compute the vertex separator. Results on the quality of the separators computed by the spectral algorithm are presented, and these are compared with separators obtained from other algorithms for computing separators. Finally, the time required to compute the Laplacian eigenvector is reported, and the accuracy with which the eigenvector must be computed to obtain good separators is considered. The spectral algorithm has the advantage that it can be implemented on a medium-size multiprocessor in a straightforward manner.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Golub, G. (2012) · doi:10.56021/9781421407944 · Cited by 34,505
Combinatorial Optimization: Algorithms and Complexity.
Johnson, D. S., Papadimitriou, C. H., & Steiglitz, K. (1984) · The American Mathematical Monthly · doi:10.2307/2322374 · Cited by 5,942
An Efficient Heuristic Procedure for Partitioning Graphs
Kernighan, B. W., & Lin, S. (1970) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1970.tb01770.x · Cited by 5,305
Algebraic connectivity of graphs
Fiedler, M. (1973) · Czechoslovak Mathematical Journal · doi:10.21136/cmj.1973.101168 · Cited by 3,977
Combinatorial optimization: networks and matroids
Lawler, E. L. (2021) · Cited by 3,359
The Symmetric Eigenvalue Problem
Parlett, B. N. (1998) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971163 · Cited by 3,192
Biggs, N. (1974) · doi:10.1017/cbo9780511608704 · Cited by 2,940
An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
Hopcroft, J. E., & Karp, R. M. (1973) · SIAM Journal on Computing · doi:10.1137/0202019 · Cited by 2,802
Computer Solution of Large Sparse Positive Definite Systems.
Pasciak, J. E., George, A., & Liu, J. W. (1982) · Mathematics of Computation · doi:10.2307/2007640 · Cited by 1,874
cacute, C., Vs, M., Doob, M., & Sachs, H. (1980) · Cited by 1,478
Blum, M., Floyd, R. W., Pratt, V., Rivest, R. L., & Tarjan, R. E. (1973) · Journal of Computer and System Sciences · doi:10.1016/s0022-0000(73)80033-9 · Cited by 1,235
Alon, N. (1986) · Combinatorica · doi:10.1007/bf02579166 · Cited by 1,137
THE LAPLACIAN SPECTRUM OF GRAPHS y
Mohar, B. (1991) · Cited by 1,090
Nested Dissection of a Regular Finite Element Mesh
George, A. (1973) · SIAM Journal on Numerical Analysis · doi:10.1137/0710032 · Cited by 1,064
A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory
Fiedler, M. (1975) · Czechoslovak Mathematical Journal · doi:10.21136/cmj.1975.101357 · Cited by 1,042
λ1, Isoperimetric inequalities for graphs, and superconcentrators
Alon, N., & Milman, V. D. (1985) · Journal of Combinatorial Theory, Series B · doi:10.1016/0095-8956(85)90092-9 · Cited by 839
Lower Bounds for the Partitioning of Graphs
Donath, W. E., & Hoffman, A. J. (1973) · IBM Journal of Research and Development · doi:10.1147/rd.175.0420 · Cited by 660
Duff, I. S., Grimes, R. G., & Lewis, J. G. (1989) · ACM Transactions on Mathematical Software · doi:10.1145/62038.62043 · Cited by 650
Eigenvalues of the Laplacian of a graph∗
Anderson, W. N., & Morley, T. D. (1985) · Linear and Multilinear Algebra · doi:10.1080/03081088508817681 · Cited by 475
A framework for solving VLSI graph layout problems
Bhatt, S. N., & Leighton, F. T. (1984) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(84)90071-0 · Cited by 438
Special matrices and their applications in numerical mathematics
Fiedler, M. (1986) · Springer eBooks · doi:10.1007/978-94-009-4335-3 · Cited by 427
The Lanczos algorithm with selective orthogonalization
Parlett, B. N., & Scott, D. S. (1979) · Mathematics of Computation · doi:10.1090/s0025-5718-1979-0514820-3 · Cited by 403
Leighton, T., & Rao, S. (1988) · [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1988.21958 · Cited by 395
Isoperimetric numbers of graphs
Mohar, B. (1989) · Journal of Combinatorial Theory, Series B · doi:10.1016/0095-8956(89)90029-4 · Cited by 331
The variation of the spectrum of a normal matrix
Hoffman, A. J., & Wielandt, H. W. (1953) · Duke Mathematical Journal · doi:10.1215/s0012-7094-53-02004-3 · Cited by 314
Eigenvalues, diameter, and mean distance in graphs
Mohar, B. (1991) · Graphs and Combinatorics · doi:10.1007/bf01789463 · Cited by 301
An Algorithm for Partitioning the Nodes of a Graph
Barnes, E. R. (1982) · SIAM Journal on Algebraic Discrete Methods · doi:10.1137/0603056 · Cited by 299
On Algorithms for Obtaining a Maximum Transversal
Duff, I. S. (1981) · ACM Transactions on Mathematical Software · doi:10.1145/355958.355963 · Cited by 203
Generalizations of Davidson’s Method for Computing Eigenvalues of Sparse Symmetric Matrices
Morgan, R. B., & Scott, D. S. (1986) · SIAM Journal on Scientific and Statistical Computing · doi:10.1137/0907054 · Cited by 171
On the determination of χl,η+−0 AND η000 from bubble chamber measurements
Votruba, J. (1975) · Czechoslovak Journal of Physics · doi:10.1007/bf01591018 · Cited by 96
Graph Coloring Using Eigenvalue Decomposition
Aspvall, B., & Gilbert, J. R. (1984) · SIAM Journal on Algebraic and Discrete Methods · doi:10.1137/0605051 · Cited by 63
Constructions of telephone networks by group representations
Bien, F. (1989) · Notices of the American Mathematical Society · Cited by 52
Cited by
Normalized cuts and image segmentation
Shi, J., & Malik, J. (2000) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.868688 · Cited by 15,502
Iterative Methods for Sparse Linear Systems
Saad, Y. (2003) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898718003 · Cited by 13,790
Modularity and community structure in networks
Newman, M. E. J. (2006) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0601602103 · Cited by 12,256
Complex networks: structure and dynamics
BOCCALETTI, S., LATORA, V, MORENO, Y., CHAVEZ, M., & HWANG, D. (2006) · Physics Reports · doi:10.1016/j.physrep.2005.10.009 · Cited by 11,010
A tutorial on spectral clustering
von Luxburg, U. (2007) · Statistics and Computing · doi:10.1007/s11222-007-9033-z · Cited by 10,349
Metadata
- Authors
- Pothen, A., Simon, H. D., & Liou, K.-P.
- Venue
- SIAM Journal on Matrix Analysis and Applications
- Published
- 1990-07
- Volume
- 11
- Issue
- 3
- Pages
- 430-452
- ISSN
- 0895-4798 (ISSN-L)
- 1095-7162
- OpenAlex
- W2114030927
- Cited by
- 1,684
- References
- 32
- FWCI
- 30.24
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.