157 citations · 421 across the 63 of their papers we have counts for
12 papers · 1 filter
High-Quality Shared-Memory Graph Partitioning
Yaroslav Akhremtsev, Peter Sanders, Christian Schulz
Partitioning graphs into blocks of roughly equal size such that few edges run between blocks is a frequently needed operation in processing graphs. Recently, size, variety, and str…
Communication-free Massively Distributed Graph Generation
Daniel Funke, Sebastian Lamm, Ulrich Meyer +5
Analyzing massive complex networks yields promising insights about our everyday lives. Building scalable algorithms to do so is a challenging task that requires a careful analysis…
Memetic Multilevel Hypergraph Partitioning
Robin Andre, Sebastian Schlag, Christian Schulz
Hypergraph partitioning has a wide range of important applications such as VLSI design or scientific computing. With focus on solution quality, we develop the first multilevel meme…
Evolutionary Acyclic Graph Partitioning
Orlando Moreira, Merten Popp, Christian Schulz
Directed graphs are widely used to model data flow and execution dependencies in streaming applications. This enables the utilization of graph partitioning algorithms for the probl…
Practical Minimum Cut Algorithms
Monika Henzinger, Alexander Noe, Christian Schulz +1
The minimum cut problem for an undirected edge-weighted graph asks us to divide its set of nodes into two blocks while minimizing the weight sum of the cut edges. Here, we introduc…
Scalable Kernelization for Maximum Independent Sets
Demian Hespe, Christian Schulz, Darren Strash
The most efficient algorithms for finding maximum independent sets in both theory and practice use reduction rules to obtain a much smaller problem instance called a kernel. The ke…