Regular ArticleMultilevelk-way Partitioning Scheme for Irregular Graphs☆,☆☆
References (28)
- et al.
A fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems
Proceedings of the Sixth SIAM Conference on Parallel Processing for Scientific Computing
(1993) - et al.
A heuristic for reducing fill in sparse matrix factorization
6th SIAM Conf. Parallel Processing for Scientific Computing
(1993) - et al.
An improved two-way partitioning algorithm with stable performance
IEEE Trans. Computer Aided Design
(Dec. 1991) - et al.
A linear time heuristic for improving network partitions
Proc. 19th IEEE Design Automation Conference
(1982) - et al.
Finding clusters in VLSI circuits
Proceedings of IEEE International Conference on Computer Aided Design
(1990) - et al.
A parallel graph partitioning algorithm for a message-passing multiprocessor
Int. J. Parallel Program.
(1987) - et al.
Fast spectral methods for ratio cut partitioning and clustering
Proceedings of IEEE International Conference on Computer Aided Design
(1991) - et al.
A new approach to effective circuit clustering
Proceedings of IEEE International Conference on Computer Aided Design
(1992) - et al.
A Cartesian parallel nested dissection algorithm
SIAM J. Matrix Anal. Appl.
(1995) - et al.
An Improved Pectral Graph Partitioning Algorithm for Mapping Parallel Computations
Technical Report
(1992)
The Chaco User's Guide
Technical Report
A Multilevel Algorithm for Partitioning Graphs
Technical Report
Analysis of Multilevel Graph Partitioning
Technical Report
Cited by (0)
- ☆
This work was supported by NSF CCR-9423082, by the Army Research Office Contract DA/DAAH04-95-1-0538, by the IBM Partnership Award, and by the Army High Performance Computing Research Center under the auspices of the Department of the Army, Army Research Laboratory Cooperative Agreement Number DAAH04-95-2-0003/Contract DAAH04-95-C-0008, the content of which does not necessarily reflect the position or the policy of the government, and no official endorsement should be inferred. Access to computing facilities was provided by AHPCRC, Minnesota Supercomputer Institute, Cray Research Inc., and the Pittsburgh Supercomputing Center. Related papers are available via WWW at URL:http://www.cs.umn.edu/∼karypis.
- ☆☆
A. GeorgeJ. R. GilbertJ. W.-H. Liu
- 2
E-mail: [email protected].
- 3
E-mail: [email protected].