187 citations · 581 across the 39 of their papers we have counts for
Showing 2013 · cs.DSShow all
2 papers · 2 filters
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.DS2013
Finding all Convex Cuts of a Plane Graph in Polynomial Time
Roland Glantz, Henning Meyerhenke
Convexity is a notion that has been defined for subsets of $\RR^n$ and for subsets of general graphs. A convex cut of a graph is a -partition s…