metis
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 a multilevel paradigm that, at the time, had been shown to produce quality results and scale to large problems.
No hi ha cap paquet oficial disponible per a openSUSE Leap 16.0Distribucions
openSUSE Tumbleweed
openSUSE Slowroll
openSUSE Leap 16.0
openSUSE Leap 15.6
SLFO 1.2
openSUSE Backports for SLE 15 SP7
openSUSE Backports for SLE 15 SP4
SUSE SLE-15-SP1
Arch Extra
Distribucions sense suport
Les distribucions següents no tenen suport oficial. Useu aquests paquets segons la vostra responsabilitat.