Serial Graph Partitioning and Fill-reducing Matrix Ordering (64bit INTEGER)
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. This build has 64bit INTEGER support.
Release | Stable | Testing |
---|---|---|
Fedora Rawhide | 5.1.0.3-2.fc39 | - |
Fedora 39 | 5.1.0.3-2.fc39 | - |
Fedora 38 | 5.1.0-34.fc38 | - |
Fedora 37 | 5.1.0-33.fc37 | - |
EPEL 9 | 5.1.0-32.el9 | - |
EPEL 7 | 5.1.0-12.el7 | - |
You can contact the maintainers of this package via email at
metis dash maintainers at fedoraproject dot org
.