A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- 1 January 1998
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 20 (1), 359-392
- https://doi.org/10.1137/s1064827595287997
Abstract
No abstract availableThis publication has 18 references indexed in Scilit:
- Geometric Mesh Partitioning: Implementation and ExperimentsSIAM Journal on Scientific Computing, 1998
- Highly scalable parallel algorithms for sparse matrix factorizationIEEE Transactions on Parallel and Distributed Systems, 1997
- An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel ComputationsSIAM Journal on Scientific Computing, 1995
- A Cartesian Parallel Nested Dissection AlgorithmSIAM Journal on Matrix Analysis and Applications, 1995
- An improved two-way partitioning algorithm with stable performance (VLSI)IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1991
- The Evolution of the Minimum Degree Ordering AlgorithmSIAM Review, 1989
- A parallel graph partitioning algorithm for a message-passing multiprocessorInternational Journal of Parallel Programming, 1987
- Graph bisection algorithms with good average case behaviorCombinatorica, 1987
- An Algorithm for Partitioning the Nodes of a GraphSIAM Journal on Algebraic Discrete Methods, 1982
- Nested Dissection of a Regular Finite Element MeshSIAM Journal on Numerical Analysis, 1973