blob: 650932ca313469a8112db00187d170d8cbdb221c (
plain) (
blame)
1
2
3
4
5
6
7
8
9
10
|
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 provides high-quality partitions, is extremely fast, and
produces low-fill orderings.
See also: https://github.com/KarypisLab/METIS
|
