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.
- Sources inherited from project windows:mingw:win32
- Download package
-
Checkout Package
osc -A https://api.opensuse.org checkout home:rhabacker:branches:windows:mingw:win32/mingw32-metis && cd $_ - Create Badge
Refresh
Refresh
Source Files
| Filename | Size | Changed |
|---|---|---|
| metis-5.1.0.tar.gz | 0004984968 4.75 MB | |
| metis-cmake.patch | 0000002677 2.61 KB | |
| metis-mingw.patch | 0000001029 1 KB | |
| metis-programs-no-compilation-time.patch | 0000002976 2.91 KB | |
| mingw32-metis.changes | 0000000369 369 Bytes | |
| mingw32-metis.spec | 0000003068 3 KB |
Comments 0