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.
You can contact the maintainers of this package via email at
metis dash maintainers at fedoraproject dot org.