Description
Parallel Graph Partitioning and Fill-reducing Matrix Ordering.
MPI-based parallel library that implements a variety of algorithms for partitioning unstructured graphs, meshes, and for computing fill-reducing orderings of sparse matrices. The algorithms implemented in ParMETIS are based on the multilevel recursive-bisection, multilevel k-way, and multi-constraint partitioning schemes.