metis 5.1.0 Graph partitioning and fill-reducing matrix ordering library
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.
- Website: http://glaros.dtc.umn.edu/gkhome/metis/metis/overview
- License: ASL 2.0
- Package source: maths.scm
- Patches: None
- Builds: x86_64-linux, i686-linux