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 SUSE:SLE-15-SP1:Update
-
Checkout Package
osc checkout SUSE:SLE-15-SP6:GA/metis && cd $_
- Create Badge
Refresh
Refresh
Source Files
Revision 1 (latest revision is 2)
Samu Voutilainen (Smar)
committed
(revision 1)
osc copypac from project:openSUSE.org:SUSE:SLE-15-SP1:Update package:metis revision:5d9aa1d6e4b5e049c67e36e8584e39b1
Comments 0