Think Locally, Act Globally: Perfectly Balanced Graph Partitioning
Data Structures and Algorithms
2012-10-02 v1 Distributed, Parallel, and Cluster Computing
Neural and Evolutionary Computing
Abstract
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 constraint into a model allowing us to find combinations of these searches maintaining balance by applying a negative cycle detection algorithm. We combine this technique with an algorithm to balance unbalanced solutions and integrate it into a parallel multi-level evolutionary algorithm, KaFFPaE, to tackle the problem. Overall, we obtain a system that is fast on the one hand and on the other hand is able to improve or reproduce most of the best known perfectly balanced partitioning results ever reported in the literature.
Cite
@article{arxiv.1210.0477,
title = {Think Locally, Act Globally: Perfectly Balanced Graph Partitioning},
author = {Peter Sanders and Christian Schulz},
journal= {arXiv preprint arXiv:1210.0477},
year = {2012}
}