3 papers
cs.DS2021
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…
cs.DS2020
Multilevel Acyclic Hypergraph Partitioning
Merten Popp, Sebastian Schlag, Christian Schulz +1
A directed acyclic hypergraph is a generalized concept of a directed acyclic graph, where each hyperedge can contain an arbitrary number of tails and heads. Directed hypergraphs ca…
cs.DS2018
Scalable Edge Partitioning
Sebastian Schlag, Christian Schulz, Daniel Seemaier +1
Edge-centric distributed computations have appeared as a recent technique to improve the shortcomings of think-like-a-vertex algorithms on large scale-free networks. In order to in…