Daniel A. Spielman, Shang-Hua Teng  Home/Search
Context Related
| berkeley.edu/techreport...CSD96898.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: berkeley.edu/accessP...CSD96898 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Spectral partitioning methods use the Fiedler vector---the eigenvector of the secondsmallest 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):
31.1%: Spectral Partitioning Works: Planar graphs and finite element.. - Spielman, Teng (1996) (Correct)
Active bibliography (related documents): More All
0.4: Moments of Inertia and Graph Separators - Gremban, Miller, Teng (1994) (Correct)
0.3: Min-Max-Boundary Domain Decomposition - Kiwi, Spielman, Teng (Correct)
0.3: Partitioning Meshes with Lines and Planes - Cao, Gilbert, Teng (1996) (Correct)
Similar documents based on text:
0.0: Unknown - (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/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/spielman96spectral.html" }
Citations (may not include all citations):481 Algorithms in Combinatorial Geometry (context) - Edelsbrunner - 1987
309 Partitioning sparse matrices with eigenvectors of graphs (context) - Pothen, Simon et al. - 1990
277 A fast algorithm for particles simulations - Greengard, Roklin - 1987
258 Lattices and Groups (context) - Conway, Sloane - 1988
257 force calculation algorithm (context) - Barnes, Hut et al. - 1986
227 An Analysis of the Finite Element Method (context) - Strang, Fix - 1973
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
189 Numerical solution of partial differential equations by the .. (context) - Johnson - 1992
182 Algebraic Graph Theory (context) - Biggs - 1993
170 A partitioning strategy for nonuniform problems on multiproc.. (context) - Berger, Bokhari - 1987
168 An approximate max-flow min-cut theorem for uniform multicom.. (context) - Leighton, Rao - 1988
156 Computer Simulation Using Particles (context) - Hackney, Eastwood - 1981
144 Performance of dynamic load balancing algorithms for unstruc.. - Williams - 1990
131 Combinatorial Geometry (context) - Agarwal, Pach - 1995
126 Eigenvalues and expanders (context) - Alon - 1986
121 Recent directions in netlist partitioning: A survey (context) - Alpert, Kahng - 1995
117 Mesh generation and optimal triangulation - Bern, Eppstein - 1992
116 Geometric bounds for eigenvalues of Markov chains (context) - Diaconis, Strook - 1991
109 Provably good mesh generation - Bern, Eppstein et al. - 1994
106 approximation algorithms for MAX CUT and MAX 2SAT (context) - Goemans, Williamson - 1994
92 A property of eigenvectors of nonnegative symmetric matrices.. (context) - Fiedler - 1975
88 the angle condition in the finite element method (context) - Babuska, Aziz - 1976
88 Eigenvalues and graph bisection: An average-case analysis (context) - Boppana - 1987
85 Harcourt Brace Jovanovich (context) - Strang, Its - 1988
84 The geometry and topology of 3-manifolds (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
70 The Laplacian spectrum of graphs (context) - Mohar - 1988
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 of 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
44 Numerical Grid Generation: Foundations and Applications (context) - Thompson, Warsi et al. - 1985
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
35 algorithm for three-dimensional n-body simulation (context) - Zhao - 1987
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 way ratio cut partitioning and clustering (context) - Chan, Schlag et al. - 1993
29 Estimating the largest eigenvalues with the lanczos algorith.. (context) - Parlett, Simon et al. - 1982
29 Condition of finite element matrices generated from nonunifo.. (context) - Fried - 1972
28 Separators for spherepackings and nearest neighborhood graph.. (context) - Miller, Teng et al. - 1996
21 the performance of the spectral graph partitioning methods - Guattery, Miller - 1995
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 Direct discretization of planar div-curl problems (context) - Nicolaides - 1992
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
15 A deterministic linear time algorithm for geometric separato.. - Eppstein, Miller et al. - 1995
12 Separators in graphs with negative and multiple vertex weigh.. - Djidjev, Gilbert - 1992
12 personal communication (context) - Guattery, Miller - 1996
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 Disk packings and planar separators (context) - Spielman, Teng - 1996
7 On convex polyhedra of finite volume in lobacevskii space (context) - Andreev - 1970
7 Graph Separator Theorems and Sparse Gaussian Elimination (context) - Gilbert - 1980
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 Chelsea Publishing Company (context) - Hilbert, Cohn-Vossen et al. - 1952
4 A theorem on planar graphs (context) - Ungar - 1951
4 personal communication (context) - Gilbert, Kahale - 1995
4 Progress in Combinatorial Optimization (context) - Barnes, Hoffman et al. - 1984
4 Spectra of Graphs : Theory and Application (context) - Cvetkovic, Doob et al. - 1990
3 An impoved spectral graph partitioning algorithm for mapping.. (context) - Hendrickson, Leland - 1992
3 Eigenvalue bounds on convergence to stationarity for nonreve.. (context) - Fill - 1991
3 Diamaters and eigenvalues (context) - Chung - 1989
3 Algebraic connectibity of graphs (context) - Fiedler - 1973
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