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.
-
Links to openSUSE:Factory / metis
-
Download package
Source Files
(show merged sources derived from linked package)
Filename | Size | Changed | Actions |
---|---|---|---|
_link | 0000000448448 Bytes | 1407751243over 3 years ago | ![]() |