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.

Version: 5.1.0

General Commands

gpmetis Partitions a graph into a specified number of parts.
m2gmetis Converts a mesh into a graph that is compatible with METIS.
mpmetis Partitions a mesh into a specified number of parts.
ndmetis Computes a fill-reducing ordering of the vertices of the graph using multilevel nested dissection.