We present new refinement heuristics for the balanced graph partitioning...
Balanced hypergraph partitioning is an NP-hard problem with many
applica...
In recent years, significant advances have been made in the design and
e...
We present a shared-memory parallelization of flow-based refinement, whi...
Balanced hypergraph partitioning is a classical NP-hard optimization pro...
This paper considers the balanced hypergraph partitioning problem, which...
Partitioning a graph into blocks of "roughly equal" weight while cutting...
We present a shared-memory algorithm to compute high-quality solutions t...
Hypergraph partitioning is an important preprocessing step for optimizin...
Quasi-threshold graphs are {C_4, P_4}-free graphs, i.e., they do not
con...
The balanced hypergraph partitioning problem is to partition a hypergrap...
In this paper, we propose HyperFlowCutter, an algorithm for balanced
hyp...
Graph partitioning has many applications. We consider the acceleration o...