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 science
- Devel package for openSUSE:Factory
-
4
derived packages
- Links to openSUSE:Factory / metis
- Download package
-
Checkout Package
osc -A https://api.opensuse.org checkout home:redwil:15.4/metis && cd $_
- Create Badge
Refresh
Refresh
Source Files
Filename | Size | Changed |
---|---|---|
_link | 0000000124 124 Bytes | |
_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 | 0000002909 2.84 KB | |
metis.spec | 0000007954 7.77 KB |
Revision 5 (latest revision is 21)
- General spec file clean up. - Touch-up to the HPC build. - Implemented suse-hpc packaging - Added metis-makefile-c-directives.patch - Provides cflags option to help provide metis native build process
Comments 0