2012-03-17 14:55:41 +01:00
|
|
|
METIS is a set of serial programs for partitioning graphs,
|
2012-07-09 13:11:44 +02:00
|
|
|
partitioning finite element meshes, and producing fill-reducing
|
2012-03-17 14:55:41 +01:00
|
|
|
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.
|
1998-04-26 05:55:22 +02:00
|
|
|
|
2012-07-09 13:11:44 +02:00
|
|
|
METIS provides high-quality partitions, is extremely fast, and
|
|
|
|
produces low-fill orderings.
|
2003-08-04 18:17:11 +02:00
|
|
|
|
2012-03-17 14:55:41 +01:00
|
|
|
WWW: http://glaros.dtc.umn.edu/gkhome/metis/metis/overview
|