A Parallel Algorithm for Multilevel Graph Partitioning and Sparse Matrix Ordering
George Karypis, Vipin Kumar · Journal of Parallel and Distributed Computing · 1998
Cited by 500 works. doi:10.1006/jpdc.1997.1403
Authors
References
- An Efficient Heuristic Procedure for Partitioning Graphs
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- Computer Solution of Large Sparse Positive Definite Systems.
- Introduction to parallel computing: design and analysis of algorithms
- A Simple Parallel Algorithm for the Maximal Independent Set Problem
- Multilevelk-way Partitioning Scheme for Irregular Graphs
- A multilevel algorithm for partitioning graphs
- The Chaco user`s guide. Version 1.0
- Modification of the minimum-degree algorithm by multiple elimination
- Fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems