97 citations · 392 across the 64 of their papers we have counts for
Showing 2012 · cs.DSShow all
2 papers · 2 filters
cs.DS2012★ 5 cited
Think Locally, Act Globally: Perfectly Balanced Graph Partitioning
Peter Sanders, Christian Schulz
We present a novel local improvement scheme for the perfectly balanced graph partitioning problem. This scheme encodes local searches that are not restricted to a balance constrain…
cs.DS2012★ 5 cited
Advanced Coarsening Schemes for Graph Partitioning
Ilya Safro, Peter Sanders, Christian Schulz
The graph partitioning problem is widely used and studied in many practical and theoretical applications. The multilevel strategies represent today one of the most effective and ef…