Parallel Multilevel series k-Way Partitioning Scheme for Irregular Graphs
- 1 January 1999
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Review
- Vol. 41 (2) , 278-300
- https://doi.org/10.1137/s0036144598334138
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular GraphsSIAM Journal on Scientific Computing, 1998
- Multilevelk-way Partitioning Scheme for Irregular GraphsJournal of Parallel and Distributed Computing, 1998
- A Parallel Algorithm for Multilevel Graph Partitioning and Sparse Matrix OrderingJournal of Parallel and Distributed Computing, 1998
- Highly scalable parallel algorithms for sparse matrix factorizationIEEE Transactions on Parallel and Distributed Systems, 1997
- A Cartesian Parallel Nested Dissection AlgorithmSIAM Journal on Matrix Analysis and Applications, 1995
- A Parallel Graph Coloring HeuristicSIAM Journal on Scientific Computing, 1993
- Partitioning Sparse Matrices with Eigenvectors of GraphsSIAM Journal on Matrix Analysis and Applications, 1990
- A Simple Parallel Algorithm for the Maximal Independent Set ProblemSIAM Journal on Computing, 1986
- Nested Dissection of a Regular Finite Element MeshSIAM Journal on Numerical Analysis, 1973
- An Efficient Heuristic Procedure for Partitioning GraphsBell System Technical Journal, 1970