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.
- Developed at science
- Sources inherited from project openSUSE:Factory
-
4
derived packages
- Download package
-
Checkout Package
osc -A https://api.opensuse.org checkout openSUSE:Backports:SLE-15-SP4:FactoryCandidates/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 | 0000003283 3.21 KB | |
metis.spec | 0000007757 7.58 KB |
Revision 5 (latest revision is 10)
Stephan Kulow (coolo)
accepted
request 665684
from
Egbert Eich (eeich)
(revision 5)
- Remove dependency to a non-existing module package for HPC. (forwarded request 665683 from eeich)
Comments 0