97 citations · 392 across the 64 of their papers we have counts for
12 papers · 1 filter
k-way Hypergraph Partitioning via n-Level Recursive Bisection
Sebastian Schlag, Vitali Henne, Tobias Heuer +3
We develop a multilevel algorithm for hypergraph partitioning that contracts the vertices one at a time. Using several caching and lazy-evaluation techniques during coarsening and…
Fast Parallel Operations on Search Trees
Yaroslav Akhremtsev, Peter Sanders
Using (a,b)-trees as an example, we show how to perform a parallel split with logarithmic latency and parallel join, bulk updates, intersection, union (or merge), and (symmetric) s…
Advanced Multilevel Node Separator Algorithms
Peter Sanders, Christian Schulz
A node separator of a graph is a subset S of the nodes such that removing S and its incident edges divides the graph into two disconnected components of about equal size. In this w…
Finding Near-Optimal Independent Sets at Scale
Sebastian Lamm, Peter Sanders, Christian Schulz +2
The independent set problem is NP-hard and particularly difficult to solve in large sparse graphs. In this work, we develop an advanced evolutionary algorithm, which incorporates k…
Operating Power Grids with Few Flow Control Buses
Thomas Leibfried, Tamara Mchedlidze, Nico Meyer-Hübner +5
Future power grids will offer enhanced controllability due to the increased availability of power flow control units (FACTS). As the installation of control units in the grid is an…
Incorporating Road Networks into Territory Design
Nitin Ahuja, Matthias Bender, Peter Sanders +2
Given a set of basic areas, the territory design problem asks to create a predefined number of territories, each containing at least one basic area, such that an objective function…