KIT | KIT-Bibliothek | Impressum | Datenschutz

Distributed Evolutionary Graph Partitioning

Sanders, Peter; Schulz, Christian


We present a novel distributed evolutionary algorithm, KaFFPaE, to solve the Graph Partitioning Problem, which makes use of KaFFPa (Karlsruhe Fast Flow Partitioner). The use of our multilevel graph partitioner KaFFPa provides new effective crossover and mutation operators. By combining these with a scalable communication protocol we obtain a system that is able to improve the best known partitioning results for many inputs in a very short amount of time. For example, in Walshaw's well known benchmark tables we are able to improve or recompute 76% of entries for the tables with 1%, 3% and 5% imbalance.

DOI: 10.1137/1.9781611972924.2
Zitationen: 53
Zugehörige Institution(en) am KIT Institut für Theoretische Informatik (ITI)
Publikationstyp Proceedingsbeitrag
Publikationsmonat/-jahr 01.2012
Sprache Englisch
Identifikator ISBN: 978-1-61197-292-4
KITopen-ID: 1000097644
Erschienen in 2012 Proceedings of the Fourteenth Workshop on Algorithm Engineering and Experiments (ALENEX). Ed.: D. Bader
Verlag Society for Industrial and Applied Mathematics
Seiten 16–29
Nachgewiesen in Dimensions
KIT – Die Forschungsuniversität in der Helmholtz-Gemeinschaft
KITopen Landing Page