157 citations · 421 across the 63 of their papers we have counts for
Showing 2013Show all
3 papers · 1 filter
cs.DS2013★ 63 cited
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.
cs.DC2013★ 13 cited
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…
cs.DS2013
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…