Package metis

Serial Graph Partitioning and Fill-reducing Matrix Ordering

METIS is a set of serial programs for partitioning graphs,
partitioning finite element meshes, and producing fill reducing
orderings for sparse matrices.
The algorithms implemented in METIS are based on the multilevel
recursive-bisection, multilevel k-way, and multi-constraint
partitioning schemes developed in our lab.
METIS is distributed with OpenMP support.

General Commands (Section 1)
Partitions a graph into a specified number of parts.
Converts a mesh into a graph that is compatible with METIS.
Partitions a mesh into a specified number of parts.
Computes a fill-reducing ordering of the vertices of the graph using multilevel nested dissection.