metis
Serial Graph Partitioning and Fill-reducing Matrix Ordering
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.
Releases Overview
| Release | Stable | Testing |
|---|---|---|
| Fedora Rawhide | 5.1.0.3-6.fc41 | - |
| Fedora 41 | 5.1.0.3-6.fc41 | - |
| Fedora 40 | 5.1.0.3-5.fc40 | - |
| Fedora EPEL 9 | 5.1.0-32.el9 | - |
| Fedora EPEL 10.0 | 5.1.0.3-6.el10_0 | - |
File a new bug report »
Package Info
Related Packages
Package Info
- Upstream: http://glaros.dtc.umn.edu/gkhome/views/metis
- License(s): Apache-2.0 AND LGPL-2.0-or-later
- Maintainer: sagitter
Related Packages
You can contact the maintainers of this package via email at
metis dash maintainers at fedoraproject dot org.
Sources on Pagure