7 citations · 12 across the 3 of their papers we have counts for
5 papers
High-Quality Hypergraph Partitioning
Sebastian Schlag, Tobias Heuer, Lars Gottesbüren +3
This paper considers the balanced hypergraph partitioning problem, which asks for partitioning the vertices into disjoint blocks of bounded size while minimizing an objective f…
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…
Social Hash Partitioner: A Scalable Distributed Hypergraph Partitioner
Igor Kabiljo, Brian Karrer, Mayank Pundir +4
We design and implement a distributed algorithm for balanced -way hypergraph partitioning that minimizes fanout, a fundamental hypergraph quantity also known as the communicatio…
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…
(Semi-)External Algorithms for Graph Partitioning and Clustering
Yaroslav Akhremtsev, Peter Sanders, Christian Schulz
In this paper, we develop semi-external and external memory algorithms for graph partitioning and clustering problems. Graph partitioning and clustering are key tools for processin…