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
Information
- Source: http://glaros.dtc.umn.edu/gkhome/views/metis
- License: Apache-2.0
- Path: /usr/lib64; /usr/bin
- Documentation: http://glaros.dtc.umn.edu/gkhome/fetch/sw/metis/manual.pdf
Using metis
metis is provided by standard packages and does not require any special setup.