https://github.com/kahypar/mt-kahypar - Improved Deterministic Mode

Various improvements to the deterministic mode including Jet refinement 🚀 and better coarsening. Contributed by Robert Krause and Nikolai.

- C++
Published by larsgottesbueren 12 months ago

https://github.com/kahypar/mt-kahypar - v1.5.1

Contains multiple bug fixes for v1.5.

- C++
Published by github-actions[bot] about 1 year ago

https://github.com/kahypar/mt-kahypar - v1.5

This release features a complete rework of our library interface. It adds support for proper error handling, makes it easier to use correctly and adds some new functionality.

Note that this is a breaking change for the C interface and the Python interface, while the CLI application is untouched.

Mt-KaHyPar is now available on pypi :tada:

Additionally, we now have debian packages and support a direct integration via CMake (findpackage or fetchcontent).

- C++
Published by github-actions[bot] over 1 year ago

https://github.com/kahypar/mt-kahypar - Unconstrained Refinement

This release adds our latest unconstrained refinement algorithm, in addition to other improvements.

Improves compilation times. Code updates for the deterministic partitioner.

- C++
Published by larsgottesbueren over 2 years ago

https://github.com/kahypar/mt-kahypar - v1.3.2

• Remove dependency to KaHyPar
• Exception Handling
• Bug fixes

- C++
Published by kittobi1992 almost 3 years ago

https://github.com/kahypar/mt-kahypar - v1.3.1

• Better naming conventions for our different configurations
• Fixed vertex support

- C++
Published by kittobi1992 almost 3 years ago

https://github.com/kahypar/mt-kahypar - v1.3

New features: - Interface for implementing new objective function (without having to modify the internal implementation of the refinement algorithms) - Support for sum-of-external-degree metric - Mt-KaHyPar can map a (hyper)graph H onto a target graph G now. The objective is to minimize the weight of all Steiner trees induced by the hyperedges of H on G. This objective function is especially useful when modeling wire-lengths in VLSI design or communication costs in distributed system when some processors do not communicate with each other directly or with different speed.

- C++
Published by kittobi1992 almost 3 years ago

https://github.com/kahypar/mt-kahypar - v1.2

New features: - Windows build (supports MinGW compiler, but not MSVC) - Add configuration for partitioning (hyper)graphs into a large number of blocks (e.g., k > 1024). - Mt-KaHyPar can now optimize the cut metric - Separate library interfaces for graph and hypergraph partitioning are unified in one library interface (C and Python)

- C++
Published by kittobi1992 about 3 years ago

https://github.com/kahypar/mt-kahypar - v1.1

• Mt-KaHyPar is now compatible with the newest version of TBB.
• Mt-KaHyPar can be build from a release archive now (using the build.sh script).

- C++
Published by kittobi1992 over 3 years ago

https://github.com/kahypar/mt-kahypar - v1.0.0

- C++
Published by kittobi1992 over 3 years ago