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:Factory:Rings:1-MinimalX
- Links to openSUSE:Factory / metis
- Has a link diff
- Download package
-
Checkout Package
osc -A https://api.opensuse.org checkout openSUSE:Factory:Staging:L/metis && cd $_ - Create Badge
Refresh
Refresh
Source Files (show merged sources derived from linked package)
| Filename | Size | Changed |
|---|---|---|
| _link | 0000000448 448 Bytes |
Latest Revision
Yuchen Lin (maxlin_factory)
committed
(revision 1)
Comments 0