Serial Graph Partitioning and Fill-reducing Matrix Ordering

METIS is a family of programs for partitioning unstructured graphs and hypergraph and computing fill-reducing orderings of sparse matrices. The underlying algorithms used by METIS are based on the state-of-the-art multilevel paradigm that has been
shown to produce high quality results and scale to very large problems.

Source Files
Filename Size Changed Actions
_multibuild 0000000084 84 Bytes almost 3 years
metis-5.1.0.tar.gz 0004984968 4.75 MB about 6 years
metis-cmake.patch 0000002677 2.61 KB about 6 years
metis-makefile-c-directives.patch 0000000410 410 Bytes over 2 years
metis-programs-no-compilation-time.patch 0000002976 2.91 KB about 6 years
metis.changes 0000004302 4.2 KB 6 months
metis.spec 0000008838 8.63 KB 6 months
Comments for metis 0