1 code implementation • 4 Mar 2024 • Lars Gottesbüren, Laxman Dhulipala, Rajesh Jayaram, Jakub Lacki
In particular, our new routing methods enable the use of balanced graph partitioning, which is a high-quality partitioning method without a naturally associated routing algorithm.
no code implementations • 26 May 2022 • Ümit V. Çatalyürek, Karen D. Devine, Marcelo Fonseca Faraj, Lars Gottesbüren, Tobias Heuer, Henning Meyerhenke, Peter Sanders, Sebastian Schlag, Christian Schulz, Daniel Seemaier, Dorothea Wagner
In recent years, significant advances have been made in the design and evaluation of balanced (hyper)graph partitioning algorithms.
1 code implementation • 20 Oct 2020 • Lars Gottesbüren, Tobias Heuer, Peter Sanders, Sebastian Schlag
With just four cores, Mt-KaHyPar is also slightly faster than the fastest sequential multilevel partitioner PaToH while producing better solutions on 83% of all instances.
Distributed, Parallel, and Cluster Computing
2 code implementations • 26 Mar 2020 • Lars Gottesbüren, Michael Hamann, Sebastian Schlag, Dorothea Wagner
We present an improvement to the flow-based refinement framework of KaHyPar-MF, the current state-of-the-art multilevel $k$-way hypergraph partitioning algorithm for high-quality solutions.
Data Structures and Algorithms
1 code implementation • 3 Jul 2019 • Lars Gottesbüren, Michael Hamann, Dorothea Wagner
The solution quality is only marginally worse than that of the best-performing hypergraph partitioners KaHyPar and hMETIS, while being one order of magnitude faster.
Data Structures and Algorithms
1 code implementation • 27 Jun 2019 • Lars Gottesbüren, Michael Hamann, Tim Niklas Uhl, Dorothea Wagner
Graph partitioning has many applications.
Data Structures and Algorithms