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. This is a modified version of Metis for Code-Aster.
|aster.spec||00000039283.84 KB||1298844363over 7 years ago|
|metis-edf-4.1-2-Makefile.patch||00000042694.17 KB||1298844046over 7 years ago|
|metis-edf-4.1-2-configure.patch||00000018141.77 KB||1298844037over 7 years ago|
|metis-edf-4.1-2.noarch.tar.bz2||0000576576563 KB||1298844023over 7 years ago|
|metis-edf-4.1-no-return-in-non-void-fix.patch||00000011141.09 KB||1298844055over 7 years ago|
|metis-edf.spec||00000042434.14 KB||1301510338over 7 years ago|