97 citations · 392 across the 64 of their papers we have counts for
5 papers · 1 filter
Recent Advances in Graph Partitioning
Aydin Buluc, Henning Meyerhenke, Ilya Safro +2
We survey recent trends in practical algorithms for balanced graph partitioning together with applications and future research directions.
KaHIP v3.00 -- Karlsruhe High Quality Partitioning -- User Guide
Peter Sanders, Christian Schulz
This paper severs as a user guide to the graph partitioning framework KaHIP (Karlsruhe High Quality Partitioning). We give a rough overview of the techniques used within the framew…
Parallel String Sample Sort
Timo Bingmann, Peter Sanders
We discuss how string sorting algorithms can be parallelized on modern multi-core shared memory machines. As a synthesis of the best sequential string sorting algorithms and succes…
Transit Node Routing Reconsidered
Julian Arz, Dennis Luxen, Peter Sanders
Transit Node Routing (TNR) is a fast and exact distance oracle for road networks. We show several new results for TNR. First, we give a surprisingly simple implementation fully bas…
Efficient Parallel and External Matching
Marcel Birn, Vitaly Osipov, Peter Sanders +2
We show that a simple algorithm for computing a matching on a graph runs in a logarithmic number of phases incurring work linear in the input size. The algorithm can be adapted to…