14 citations · 25 across the 8 of their papers we have counts for
3 papers · 1 filter
Deterministic Parallel Hypergraph Partitioning
Lars Gottesbüren, Michael Hamann
Balanced hypergraph partitioning is a classical NP-hard optimization problem with applications in various domains such as VLSI design, simulating quantum circuits, optimizing data…
Deep Multilevel Graph Partitioning
Lars Gottesbüren, Tobias Heuer, Peter Sanders +2
Partitioning a graph into blocks of "roughly equal" weight while cutting only few edges is a fundamental problem in computer science with a wide range of applications. In particula…
Shared-Memory n-level Hypergraph Partitioning
Lars Gottesbüren, Tobias Heuer, Peter Sanders +1
We present a shared-memory algorithm to compute high-quality solutions to the balanced -way hypergraph partitioning problem. This problem asks for a partition of the vertex set…