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.
homepage: http://glaros.dtc.umn.edu/gkhome/metis/metis/overview
| version | versionsuffix | toolchain |
|---|---|---|
5.0.2 |
gimkl/2.11.5 |
|
5.1.0 |
GCCcore/10.2.0 |
|
5.1.0 |
GCCcore/10.3.0 |
|
5.1.0 |
GCCcore/11.2.0 |
|
5.1.0 |
-int64 |
GCCcore/11.3.0 |
5.1.0 |
GCCcore/11.3.0 |
|
5.1.0 |
GCCcore/12.2.0 |
|
5.1.0 |
GCCcore/12.3.0 |
|
5.1.0 |
GCCcore/13.2.0 |
|
5.1.0 |
GCCcore/13.3.0 |
|
5.1.0 |
GCCcore/6.4.0 |
|
5.1.0 |
GCCcore/7.3.0 |
|
5.1.0 |
GCCcore/8.2.0 |
|
5.1.0 |
GCCcore/8.3.0 |
|
5.1.0 |
GCCcore/9.3.0 |
|
5.1.0 |
-32bitIDX |
foss/2016a |
5.1.0 |
foss/2016a |
|
5.1.0 |
foss/2016b |
|
5.1.0 |
foss/2017a |
|
5.1.0 |
foss/2018b |
|
5.1.0 |
-32bitIDX |
gimkl/2.11.5 |
5.1.0 |
gimkl/2.11.5 |
|
5.1.0 |
-32bitIDX |
intel/2016a |
5.1.0 |
intel/2016a |
|
5.1.0 |
intel/2016b |
|
5.1.0 |
intel/2017a |
(quick links: (all) - 0 - a - b - c - d - e - f - g - h - i - j - k - l - m - n - o - p - q - r - s - t - u - v - w - x - y - z)