Serial Graph Partitioning and Fill-reducing Matrix Ordering

http://glaros.dtc.umn.edu/gkhome/views/metis

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.

ndmetis

Computes a fill-reducing ordering of the vertices of the graph using multilevel nested dissection.

Computes a fill-reducing ordering of the vertices of the graph using multilevel nested dissection.