Alex Pothen, Horst D. Simon, and Kang-Pu Liou. Partitioning sparse matrices with eigenvectors of graphs. SIAM J. Matrix Anal. Appl., 11(3):430--452, July 1990. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
A Spectral Algorithm for Seriation and the Consecutive.. - Atkins, Boman.. (1998) (11 citations) (Correct)
....studied by Fiedler [10, 11] and independently by Donath and Ho#man [9] More recently, there have been a number of attempts to apply spectral graph theory to problems in combinatorial optimization. For example, spectral algorithms have been developed for graph coloring [3] graph partitioning [9, 28], and envelope reduction [4] and more examples can be found in the survey papers of Mohar [23, 24] However, in most previous applications, these techniques have been used to provide bounds, heuristics, or in a few cases, approximation algorithms [2, 6, 14] for NP hard problems. There are only a ....
A. Pothen, H. D. Simon, and K.-P. Liou, Partitioning sparse matrices with eigenvectors of graphs, SIAM J. Matrix Anal. Appl., 11 (1990), pp. 430--452.
On the Performance of Spectral Graph Partitioning Methods - Stephen Guattery Gary (Correct)
No context found.
Alex Pothen, Horst D. Simon, and Kang-Pu Liou. Partitioning sparse matrices with eigenvectors of graphs. SIAM J. Matrix Anal. Appl., 11(3):430--452, July 1990.
Parallel Alignment of a Large Number of Range Images - Takeshi Oishi Institute (2003) (Correct)
No context found.
Alex Pothen, Horst D. Simon, and Kang-Pu Liou. Partitioning sparse matrices with eigenvectors of graphs. SIAM Journal of Matrix Analysis and Applications, 11(3):430--452, 1990.
New Challenges in Dynamic Load Balancing - Devine, Boman, Heaphy.. (2004) (Correct)
No context found.
A. Pothen, H. Simon, K. Liou, Partitioning sparse matrices with eigenvectors of graphs, SIAM J. Matrix Anal. 11 (3) (1990) 430--452.
A Multilevel Algorithm for the Minimum 2-sum Problem - Safro, Ron, Brandt (2006) (Correct)
No context found.
A. Pothen, H. D. Simon, and K.-P. Liou. Partitioning sparse matrices with eigenvectors of graphs. SIAM J. Matrix Anal. Appl., 11(3):430--452, 1990.
Normalized Cuts and Image Segmentation - Shi, Malik (1997) (166 citations) (Correct)
No context found.
A. Pothen, H.D. Simon, and K.P. Liou. Partitioning sparse matrices with eigenvectors of graphs. SIAM Journal of Matrix Anal. Appl., 11:430--452, 1990.
Spectral Partitioning Works:Planar graphs and finite element.. - Spielman, Teng (1996) (34 citations) (Correct)
No context found.
A. Pothen, H. D. Simon, and K.-P. Liou. Partitioning sparse matrices with eigenvectors of graphs. SIAM J. Matrix Anal. Appl., 11:430--452, 1990.
Value Balanced Agglomerative Connectivity Clustering - Gupta, Ghosh (2001) (3 citations) (Correct)
No context found.
A. Pothen, H. Simon, and K. Liou. Partitioning sparse matrices with eigenvectors of graphs. SIAM Journal of Matrix Analysis and Applications, 11:430--452, 1990.
Evaluation of Parallel Domain Decomposition Algorithms - Jesus Antonio Izaguirre (Correct)
No context found.
A. Pothen, H. Simon, and K. Liou. Partitioning sparse matrices with eigenvectors of graphs. SIAM J. Matrix Anal. Appl., 11:430--452, 1990.
The Principal Components Analysis of a Graph, and its.. - Saerens, Fouss, Yen.. (2004) (2 citations) (Correct)
No context found.
A. Pothen, H. Simon, and K.-P. Liou. Partitioning sparse matrices with eigenvectors of graphs. SIAM Journal of Matrix Analysis, 11(3):430--452, 1990.
CLUE: Cluster-based Retrieval of Images by Unsupervised.. - Chen, Wang, Krovetz (2003) (2 citations) (Correct)
No context found.
A. Pothen, H.D. Simon, and K.P. Liou, "Partitioning Sparse Matrices with Eigenvectors of Graphs," SIAM J. Matrix Analytical Applications, vol. 11, pp. 430--452, 1990.
A New Paradigm for Parallel Adaptive Meshing Algorithms - Bank, Holst (1999) (7 citations) (Correct)
No context found.
A. Pothen, H. D. Simon, and K.-P. Liou, Partitioning sparse matrices with eigenvectors of graphs, SIAM J. Matrix Anal. Appl., 11 (1990), pp. 430--452.
Automatic Parallelization of the Conjugate Gradient.. - Kotlyar, Pingali, Stodghill (Correct)
No context found.
A. Pothen, H. D. Simon, and K.-P. Liou. Partitioning sparse matrices with eigenvectors of graphs. SIAM Journal of Matrix Analysis and Applications, 11:430--452, 1990.
Parallel Adaptive Unstructured Computation - Castanos (2000) (Correct)
No context found.
Alex Pothen, Horst D. Simon, and Kang-Pu Liou. Partitioning sparse matrices with eigenvectors of graphs. SIAM Journal of Matrix Analysis, 11(3):430-452, 1990.
Toward Scaling Network Emulation using Topology Partitioning - Ken Yocum Ethan (2003) (2 citations) (Correct)
No context found.
A. Pothen, H. D. Simon, and K. P. Liou. Partitioning sparse matrices with eigenvectors of graphs. SIAM J. Matrix Anal. Appl., 11:430-- 452, 1990.
Dynamic Load-Balancing for PDE Solvers Using Adaptive.. - Walshaw, Berzins (Correct)
No context found.
A. Pothen, H. D. Simon, and Kang-Pu L. Partitioning Sparse Matrices with Eigenvectors of Graphs. SIAM J. Matrix Anal. Appl., 11:430--452, 1990. 14
On Spectral Graph Drawing - Koren (2002) (2 citations) (Correct)
No context found.
A. Pothen, H. Simon and K.-P. Liou, "Partitioning Sparse Matrices with Eigenvectors of Graphs", SIAM Journal on Matrix Analysis and Applications, 11 (1990), 430--452.
A New Paradigm for Parallel Adaptive Meshing Algorithms - Bank, Holst (2003) (7 citations) (Correct)
No context found.
A. Pothen, H. D. Simon, and K.-P. Liou, Partitioning sparse matrices with eigenvectors of graphs, SIAM J. Matrix Anal. Appl., 11 (1990), pp. 430--452.
On Bottleneck Partitioning of k-ary n-cubes - David Nicol Weizhen (1994) (Correct)
No context found.
A.Pothen, H.D. Simon, and K.P. Liou. Partitioning sparse matrices with eigenvectors of graphs. SIAM Journal of Mathematical Analysis and Applications, 11:430--452, 1990.
Graph Laplacians, Nodal Domains, - And Hyperplane Arrangements (Correct)
No context found.
A. Pothen, H. D. Simon, and K.-P. Liou. Partitioning sparse matrices with eigenvectors of graphs. SIAM J. Matrix Anal. Appl., 11:430--452, 1990.
Load Balancing of Unit Size Tokens and Expansion Properties.. - Elsässer, Monien (Correct)
No context found.
A. Pothen, H. Simon, and K. Liu. Partitioning sparse matrices with eigenvectors of graphs. SIAM J. on Matrix Analysis and Applications, 11(3):430-452, 1990.
The Path Resistance Method for Bounding the Smallest.. - Guattery, Leighton.. (1993) (Correct)
No context found.
Pothen, A., Simon, H. D. and Liou, K. P. (1990) Partitioning sparse matrices with eigenvectors of graphs. SIAM Journal on Matrix Analysis and Applications 11(3) 430-452 (July).
On Convergence Acceleration Techniques for Unstructured Meshes - Mavriplis (1998) (5 citations) (Correct)
No context found.
A. Pothen, H. D. Simon, and K. P. Liou, Partitioning sparse matrices with eigenvectors of graphs, SIAM J. Matrix Anal. Appl., 11 (1990), pp. 430--452.
A Perspective on Unstructured Grid Flow Solvers - Venkatakrishnan (1995) (2 citations) (Correct)
No context found.
A. Pothen, H. D. Simon, and K. P. Liou, Partitioning sparse matrices with eigenvectors of graphs, SIAM J. Matrix Anal. Appl., 11 (1990), pp. 430--452.
On Spectral Bounds for the k-Partitioning of Graphs - Elsässer, Lücking, Monien (Correct)
No context found.
A. Pothen, H. Simon, and K. Liu. Partitioning sparse matrices with eigenvectors of graphs. SIAM J. on Matrix Analysis and Applications, 11(3):430-452, 1990.
First 50 documents Next 50
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