Daniel A. Spielman, Shang-Hua Teng  Home/Search
Context Related
| mit.edu/~spielman/focsspect.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: mit.edu/~spielman/theory/...spect (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
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 ... (Update)
Cited by: More
A Multilevel Algorithm for the Minimum 2-sum Problem - Safro, Ron, Brandt (2006) (Correct)
Experiments on Graph Clustering Algorithms - Brandes, Gaertler, Wagner (2003) (Correct)
CS 683: Advanced Algorithms Planar Graph partitioning by.. - March Scribe Anirban (2001) (Correct)
Similar documents (at the sentence level):
73.5%: Spectral Partitioning Works: Planar graphs and finite element.. - Spielman, Teng (1996) (Correct)
55.3%: Spectral Partitioning Works:Planar graphs and finite element.. - Spielman, Teng (1996) (Correct)
Active bibliography (related documents): More All
0.4: Min-Max-Boundary Domain Decomposition - Kiwi, Spielman, Teng (Correct)
0.3: Moments of Inertia and Graph Separators - Gremban, Miller, Teng (1994) (Correct)
0.3: Graph Partitioning Algorithms With Applications To Scientific.. - Pothen (1997) (Correct)
Similar documents based on text: More All
0.4: On The Quality Of Spectral Separators - Guattery, Miller (1998) (Correct)
0.3: Generating Well-Shaped d-dimensional Delaunay Meshes - Li (Correct)
0.2: Smoothed Analysis of Renegar's Condition Number for.. - Dunagan, Spielman, Teng (2002) (Correct)
Related documents from co-citation: More All
16: Algebraic connectivity of graphs (context) - Fiedler - 1973
13: Partitioning sparse matrices with eigenvectors of graphs (context) - Pothen, Simon et al. - 1990
12: A property of eigenvectors of nonnegative symmetric matrices and its application.. (context) - Fiedler - 1975
BibTeX entry: (Update)
D. A. Spielman and S.-H. Teng, Spectral partitioning works: planar graphs and finite element meshes, Manuscript (1996). http://citeseer.ist.psu.edu/article/spielman96spectral.html More
@inproceedings{ spielman96spectral,
author = "Daniel A. Spielman and Shang-Hua Teng",
title = "Spectral Partitioning Works: Planar Graphs and Finite Element Meshes",
booktitle = "{IEEE} Symposium on Foundations of Computer Science",
pages = "96-105",
year = "1996",
url = "citeseer.ist.psu.edu/article/spielman96spectral.html" }
Citations (may not include all citations):309 Partitioning sparse matrices with eigenvectors of graphs (context) - Pothen, Simon et al. - 1990
222 A fast multilevel implementation of recursive spectral bisec.. - Barnard, Simon - 1992
219 Partitioning of unstructured problems for parallel processin.. - Simon - 1991
218 A separator theorem for planar graphs (context) - Lipton, Tarjan - 1979
168 An approximate max-flow min-cut theorem for uniform multicom.. (context) - Leighton, Rao - 1988
144 Performance of dynamic load balancing algorithms for unstruc.. - Williams - 1990
126 Eigenvalues and expanders (context) - Alon - 1986
121 Recent directions in netlist partitioning: A survey (context) - Alpert, Kahng - 1995
116 Geometric bounds for eigenvalues of Markov chains (context) - Diaconis, Strook - 1991
92 A property of eigenvectors of nonnegative symmetric matrices.. (context) - Fiedler - 1975
88 Eigenvalues and graph bisection: An average-case analysis (context) - Boppana - 1987
84 The geometry and topology of 3manifolds (context) - Thurston - 1988
82 Lower bounds for the partitioning of graphs (context) - Donath, Hoffman - 1973
73 uniform generation and rapidly mixing Markov chains (context) - Sinclair, Jerrum - 1989
73 New spectral methods for ratio cut partitioning and clusteri.. (context) - Hagen, Kahng - 1992
67 An unified geometric approach to graph separators (context) - Miller, Teng et al. - 1991
61 A separator theorem for graphs with an excluded minor and it.. (context) - Alon, Seymour et al. - 1990
57 An algorithm for partitioning the nodes of a graph (context) - Barnes - 1982
56 Conductance and the rapid mixing property for markov chains:.. (context) - Sinclair, Jerrum - 1988
45 Conductance and convergence of Markov chains -- a combinator.. (context) - Mihail - 1989
44 Isoperimetric numbers of graphs (context) - Mohar - 1989
43 A lower bound for the smallest eigenvalue of the Laplacian (context) - Cheeger - 1970
42 A Delaunay based numerical method for three dimensions: gene.. - Miller, Talmor et al. - 1995
40 isoperimetric inequalities for graphs (context) - Alon, Milman - 1985
36 Kontaktprobleme der konformen Abbildung (context) - Koebe - 1936
31 Separators in two and three dimensions (context) - Miller, Thurston - 1990
30 Domain decomposition and multigrid algorithms for elliptic p.. (context) - Chan, Smith - 1993
29 Estimating the largest eigenvalue with the Lanczos algorithm (context) - Parlett, Simon et al. - 1982
29 way ratio cut partitioning and clustering (context) - Chan, Schlag et al. - 1993
28 Separators for sphere-packings and nearest neighborhood grap.. (context) - Miller, Teng et al. - 1996
21 the performance of the spectral graph partitioning methods - Guattery, Miller - 1995
21 Eigenvalue bounds on convergence to stationarity for nonreve.. (context) - Fill - 1991
20 Algorithms for partitioning of graphs and computer logic bas.. (context) - Donath, Hoffman - 1972
18 and Separators: a unified geometric approach to graph partit.. (context) - Teng, Spheres - 1991
17 Shallow excluded minors and improved graph decomposition - Plotkin, Rao et al. - 1994
16 A separation theorem for graphs of bounded genus (context) - Gilbert, Hutchinson et al. - 1984
15 Spectral nested dissection - Pothen, Simon et al. - 1992
15 Density graphs and separators (context) - Miller, Vavasis - 1991
12 Separators in graphs with negative and multiple vertex weigh.. - Djidjev, Gilbert - 1992
12 On convex polyhedra in Lobacevskii space (context) - Andreev - 1970
9 Provably good partitioning and load balancing algorithms for.. (context) - Teng - 1996
8 Finite element meshes and geometric separators (context) - Miller, Teng et al. - 1996
8 Graph Separator Theorems and Sparse Gaussian Elimination (context) - Gilbert - 1980
7 On convex polyhedra of finite volume in Lobacevskii space (context) - Andreev - 1970
6 Chelsea Publishing Company (context) - Hilbert, Cohn-Vossen et al. - 1952
6 Technical Report SAND (context) - Hendrickson, Leland et al. - 1993
5 A framework for the analysis and construction of domain deco.. (context) - Chan, Resasco - 1987
4 Progress in Combinatorial Optimization (context) - Barnes, Hoffman et al. - 1984
4 personal communication (context) - Gilbert, Kahale - 1995
4 A theorem on planar graphs (context) - Ungar - 1951
3 Algebraic connectibity of graphs (context) - Fiedler - 1973
3 An impoved spectral graph partitioning algorithm for mapping.. (context) - Hendrickson, Leland - 1992
3 Diamaters and eigenvalues (context) - Chung - 1989
3 Eigenvectors of acyclic matices (context) - Fiedler - 1975
The graph only includes citing articles where the year of publication is known.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC