From: George Karypis Date: Sun, 20 Sep 1998 15:21:51 -0500 (CDT) Subject: Software for Graphs, Meshes and Sparse Matrices METIS A Software Package for Partitioning Unstructured Graphs, Partitioning Meshes, and Computing Fill-Reducing Orderings of Sparse Matrices http://www.cs.umn.edu/~metis http://www.cs.umn.edu/~karypis/metis Version 4.0 We would like to announce the release of version 4.0 of the METIS package for partitioning unstructured graphs, partitioning finite element meshes, and for computing fill-reducing orderings of sparse matrices. METIS 4.0 contains a number of changes over METIS 3.0. The major changes are the following: * METIS now includes partitioning routines that can be used to partition a graph in the presence of multiple balancing constraints. * METIS now includes partitioning routines that can be used to directly minimize the overall communication volume resulted by the partitioning. * METIS's k-way partitioning routines can now directly minimize the maximum as well as the total number of adjacent subdomains. * METIS's k-way partitioning routines can now reduce the number of non-contiguous subdomains. Overview of METIS METIS is a set of programs that implement various graph partitioning algorithms that are based on the multilevel paradigm. The advantages of METIS compared to other similar packages are the following: - Provides high quality partitions! - It is extremely fast! - Provides low fill orderings! Obtaining METIS METIS is freely distributed. You can download METIS's source code from the WEB at: URL: http://www.cs.umn.edu/~metis or URL: http://www.cs.umn.edu/~karypis/metis Contact Information METIS has been written by George Karypis at the Computer Science Department of the University of Minnesota. If you have any questions or problems obtaining METIS, send email to metis@cs.umn.edu. METIS is Copyrighted by the Regents of the University of Minnesota