This software enables partitioning of unstructured graphs and meshes, as well as creating fill-reducing orderings for sparse matrices.
METIS is built on a foundation of advanced algorithms, including multilevel recursive-bisection, multilevel k-way, and multi-constraint partitioning schemes. Developed in-house at our lab, these algorithms are designed to deliver top-notch performance and precision for all your graph partitioning needs.
One of the best things about METIS is its portability. Built entirely in ANSI C, it's compatible with most Unix systems that have an ANSI C compiler. The GNU C compiler is also supported, making it easy to get started on nearly any system.
Finally, you can trust METIS to deliver reliable performance on a wide variety of systems. Our team has extensively tested METIS on a variety of platforms, including AIX, Sun OS, Solaris, IRIX, Linux, HP-UX, BSD, and Unicos. So why wait? Download METIS today and take your graph partitioning to the next level!
Version 4.0.1: N/A