The DOI matches its Crossref record; 44 of the 44 references it cites were found in a registry or an index.
Spectral partitioning works: planar graphs and finite element meshes
Abstract
Spectral partitioning methods use the Fiedler vector-the eigenvector of the second-smallest eigenvalue of the Laplacian matrix-to find a small separator of a graph. These methods are important components of many scientific numerical algorithms and have been demonstrated by experiment to work extremely well. In this paper, we show that spectral partitioning methods work well on bounded-degree planar graphs and finite element meshes-the classes of graphs to which they are usually applied. While active spectral bisection does not necessarily work, we prove that spectral partitioning techniques can be used to produce separators whose ratio of vertices removed to edges cut is O(/spl radic/n) for bounded-degree planar graphs and two-dimensional meshes and O(n/sup 1/d/) for well-shaped d-dimensional meshes. The heart of our analysis is an upper bound on the second-smallest eigenvalues of the Laplacian matrices of these graphs: we prove a bound of O(1/n) for bounded-degree planar graphs and O(1/n/sup 2/d/) for well-shaped d-dimensional meshes.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Chung, F. (1996) · CBMS Regional Conference Series in Mathematics · doi:10.1090/cbms/092 · Cited by 5,524
Computer Simulation Using Particles
Hockney, R. W., & Eastwood, J. W. (1988) · Institute of Physics eBooks · doi:10.1887/0852743920 · Cited by 5,441
A fast algorithm for particle simulations
Greengard, L., & Rokhlin, V (1987) · Journal of Computational Physics · doi:10.1016/0021-9991(87)90140-9 · Cited by 4,868
Algebraic connectivity of graphs
Fiedler, M. (1973) · Czechoslovak Mathematical Journal · doi:10.21136/cmj.1973.101168 · Cited by 3,977
An analysis of the finite element method
(1980) · Advances in Water Resources · doi:10.1016/0309-1708(80)90069-x · Cited by 3,466
Sphere Packings, Lattices and Groups.
Coxeter, H. S. M., Conway, J. H., & Sloane, N. J. A. (1989) · The American Mathematical Monthly · doi:10.2307/2323992 · Cited by 3,377
Biggs, N. (1974) · doi:10.1017/cbo9780511608704 · Cited by 2,940
Spectra of graphs : theory and application
Cvetković, D., Doob, M., & Sachs, H. (1995) · Cited by 1,825
Algorithms in Combinatorial Geometry.
Goodman, J. E., & Edelsbrunner, H. (1989) · The American Mathematical Monthly · doi:10.2307/2325168 · Cited by 1,788
Numerical solution of partial differential equations by the finite element method
(1988) · Choice Reviews Online · doi:10.5860/choice.26-0972 · Cited by 1,783
Partitioning Sparse Matrices with Eigenvectors of Graphs
Pothen, A., Simon, H. D., & Liou, K.-P. (1990) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/0611030 · Cited by 1,684
A Separator Theorem for Planar Graphs
Lipton, R. J., & Tarjan, R. E. (1979) · SIAM Journal on Applied Mathematics · doi:10.1137/0136016 · Cited by 1,359
Geometry and Topology of Manifolds
(2007) · Banach Center Publications · doi:10.4064/bc76 · Cited by 1,358
New spectral methods for ratio cut partitioning and clustering
Hagen, L., & Kahng, A. B. (1992) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/43.159993 · Cited by 1,288
Alon, N. (1986) · Combinatorica · doi:10.1007/bf02579166 · Cited by 1,137
ZhouJiongpan (1995) · 中国邮电高校学报:英文版 · Cited by 1,109
THE LAPLACIAN SPECTRUM OF GRAPHS y
Mohar, B. (1991) · Cited by 1,090
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
A Lower Bound for the Smallest Eigenvalue of the Laplacian
Cheeger, J. (2015) · Problems in Analysis: A Symposium in Honor of Salomon Bochner (PMS-31) · doi:10.1515/9781400869312-013 · Cited by 961
Geometric Bounds for Eigenvalues of Markov Chains
Diaconis, P., & Stroock, D. (1991) · The Annals of Applied Probability · doi:10.1214/aoap/1177005980 · Cited by 882
λ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
(1952) · Archives of Ophthalmology · doi:10.1001/archopht.1952.00920010678023 · Cited by 819
Approximate counting, uniform generation and rapidly mixing Markov chains
Sinclair, A., & Jerrum, M. (1989) · Information and Computation · doi:10.1016/0890-5401(89)90067-9 · Cited by 735
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
The Chaco user`s guide. Version 1.0
Hendrickson, B., & Leland, R. (1993) · doi:10.2172/10106339 · Cited by 655
On the Angle Condition in the Finite Element Method
Babuska, I. M., & Aziz, A. K. (1976) · SIAM Journal on Numerical Analysis · doi:10.1137/0713021 · Cited by 649
A Partitioning Strategy for Nonuniform Problems on Multiprocessors
Berger, & Bokhari (1987) · IEEE Transactions on Computers · doi:10.1109/tc.1987.1676942 · Cited by 579
An r-Dimensional Quadratic Placement Algorithm
Hall, K. M. (1970) · Management Science · doi:10.1287/mnsc.17.3.219 · Cited by 522
MESH GENERATION AND OPTIMAL TRIANGULATION
BERN, M., & EPPSTEIN, D. (1995) · Lecture Notes Series on Computing · doi:10.1142/9789812831699_0003 · Cited by 514
An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations
Hendrickson, B., & Leland, R. (1995) · SIAM Journal on Scientific Computing · doi:10.1137/0916028 · Cited by 480
Spectral K-way ratio-cut partitioning and clustering
Chan, P. K., Schlag, M. D. F., & Zien, J. Y. (1994) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/43.310898 · Cited by 442
Leighton, T., & Rao, S. (1988) · [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1988.21958 · Cited by 395
Bern, M. W., Eppstein, D., & Gilbert, J. (1994) · Journal of Computer and System Sciences · doi:10.1016/s0022-0000(05)80059-5 · Cited by 350
Performance of dynamic load balancing algorithms for unstructured mesh calculations
Williams, R. D. (1991) · Concurrency: Practice and Experience · doi:10.1002/cpe.4330030502 · Cited by 345
Isoperimetric numbers of graphs
Mohar, B. (1989) · Journal of Combinatorial Theory, Series B · doi:10.1016/0095-8956(89)90029-4 · Cited by 331
Fill, J. A. (1991) · The Annals of Applied Probability · doi:10.1214/aoap/1177005981 · Cited by 320
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
Chung, F. (1989) · Journal of the American Mathematical Society · doi:10.1090/s0894-0347-1989-0965008-x · Cited by 252
Conductance and the rapid mixing property for Markov chains: the approximation of permanent resolved
Jerrum, M., & Sinclair, A. (1988) · Proceedings of the twentieth annual ACM symposium on Theory of computing - STOC '88 · doi:10.1145/62212.62234 · Cited by 201
Conductance and convergence of Markov chains-a combinatorial treatment of expanders
Mihail, M. (1989) · 30th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1989.63529 · Cited by 175
Spectral K -way ratio-cut partitioning and clustering
Chan, P. K., Schlag, M. D. F., & Zien, J. Y. (1993) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1145/157485.165117 · Cited by 127
Geometric Separators for Finite-Element Meshes
Miller, G. L., Teng, S., Thurston, W. P. H., & Vavasis, S. A. (1998) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827594262613 · Cited by 111
Self-citationSeparators in two and three dimensions
Miller, G. L., & Thurston, W. P. H. (1990) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/100216.100255 · Cited by 78
A DETERMINISTIC LINEAR TIME ALGORITHM FOR GEOMETRIC SEPARATORS AND ITS APPLICATIONS
Eppstein, D., Miller, G. L., & Teng, S. (1995) · Fundamenta Informaticae · doi:10.3233/fi-1995-2241 · Cited by 24
Self-citation
Cited by
Fortunato, S. (2010) · Physics Reports · doi:10.1016/j.physrep.2009.11.002 · Cited by 11,293
“Otherwise, one has to look for the eigenvector of B with largest (positive) eigenvalue, u1, and group the vertices according to the signs of the components of u1, just like in Section IV.”
BackgroundA tutorial on spectral clustering
von Luxburg, U. (2007) · Statistics and Computing · doi:10.1007/s11222-007-9033-z · Cited by 10,349
Leskovec, J., Lang, K. J., Dasgupta, A., & Mahoney, M. W. (2009) · Internet Mathematics · doi:10.1080/15427951.2009.10129177 · Cited by 1,872
Authoritative sources in a hyperlinked environment
Kleinberg, J. M. (1998) · Symposium on Discrete Algorithms · doi:10.5555/314613.315045 · Cited by 1,814
Schaeffer, S. E. (2007) · Computer Science Review · doi:10.1016/j.cosrev.2007.05.001 · Cited by 1,639
Metadata
- Authors
- Spielman, D. A., & Teng, S.-H.
- Venue
- Proceedings of 37th Conference on Foundations of Computer Science
- Publisher
- IEEE
- Published
- 1996
- Pages
- 96-105
- OpenAlex
- W2067976091
- Cited by
- 393
- References
- 44
- FWCI
- 6.97
- Type
- conference paper
- 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.