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:E/metis && cd $_
- Create Badge
Refresh
Refresh
Source Files
Filename | Size | Changed |
---|---|---|
_link | 0000000450 450 Bytes |
Revision 4 (latest revision is 21)
Lubos Kocman (lkocman-factory)
committed
(revision 4)
branch from 15.1
Comments 0