libparmetis-dev | Parallel Graph Partitioning and Sparse Matrix Ordering Libs: Devel | Mehr ...
ParMetis computes minimal-cut partitions of graphs and meshes in parallel, and orders variables for minimal fill when using direct solvers for sparse matrices. It does all this in parallel, and also can efficiently re-partition a graph or mesh whose connectivity has changed. . This package contains files needed to develop programs using ParMetis.
libparmetis3.1 | Parallel Graph Partitioning and Sparse Matrix Ordering Shared Libs | Mehr ...
ParMetis computes minimal-cut partitions of graphs and meshes in parallel, and orders variables for minimal fill when using direct solvers for sparse matrices. It does all this in parallel, and also can efficiently re-partition a graph or mesh whose connectivity has changed. . This package contains the ParMetis shared libraries.
parmetis-doc | Parallel Graph Partitioning and Sparse Matrix Ordering Lib - Docs | Mehr ...
ParMetis computes minimal-cut partitions of graphs and meshes in parallel, and orders variables for minimal fill when using direct solvers for sparse matrices. It does all this in parallel, and also can efficiently re-partition a graph or mesh whose connectivity has changed. . This package contains the documentation and example files.
parmetis-test | Parallel Graph Partitioning and Sparse Matrix Ordering Tests | Mehr ...
ParMetis computes minimal-cut partitions of graphs and meshes in parallel, and orders variables for minimal fill when using direct solvers for sparse matrices. It does all this in parallel, and also can efficiently re-partition a graph or mesh whose connectivity has changed. . This package contains programs which test the ParMetis libraries using files in the parmetis-doc package's examples directory.
