Serial Graph Partitioning and Fill-reducing Matrix Ordering

Edit Package metis

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.

Refresh
Refresh
Source Files
Filename Size Changed
Comments 0
No comments available
openSUSE Build Service is sponsored by