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 openSUSE:Leap:15.2:Rings:1-MinimalX
- Links to openSUSE:Leap:15.2 / metis
- Has a link diff
- Download package
-
Checkout Package
osc -A https://api.opensuse.org checkout openSUSE:Leap:15.2:Staging:N/metis && cd $_ - Create Badge
Refresh
Refresh
Source Files
| Filename | Size | Changed |
|---|---|---|
| _multibuild | 0000000084 84 Bytes | |
| metis-5.1.0.tar.gz | 0004984968 4.75 MB | |
| metis-cmake.patch | 0000002677 2.61 KB | |
| metis-makefile-c-directives.patch | 0000000410 410 Bytes | |
| metis-programs-no-compilation-time.patch | 0000002976 2.91 KB | |
| metis.changes | 0000003951 3.86 KB | |
| metis.spec | 0000008449 8.25 KB |
Comments 0