sci@gentoo.org Gentoo Science Project METIS is a set of serial programs for partitioning graphs, partitioning finite element meshes, and producing fill reducing orderings for sparse matrices. The algorithms implemented in METIS are based on the multilevel recursive-bisection, multilevel k-way, and multi-constraint partitioning schemes. Use double- rather than single-precision floating-point representation Use 64- rather than 32-bit integer representation (needed for > 2^31 vertices)