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.
|metis-5.1.0.tar.gz||0004984968 4.75 MB||almost 6 years|
|metis-cmake.patch||0000002677 2.61 KB||almost 6 years|
|metis-programs-no-compilation-time.patch||0000002976 2.91 KB||almost 6 years|
|metis.changes||0000002473 2.42 KB||almost 6 years|
|metis.spec||0000004590 4.48 KB||almost 6 years|