Open access
Proceedings
2012 Proceedings of the Fourteenth Workshop on Algorithm Engineering and Experiments (ALENEX)

Distributed Evolutionary Graph Partitioning

Abstract

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.

Formats available

You can view the full content in the following formats:

Information & Authors

Information

Published In

cover image Proceedings
2012 Proceedings of the Fourteenth Workshop on Algorithm Engineering and Experiments (ALENEX)
Pages: 16 - 29
Editors: David A. Bader, Georgia Institute of Technology, Atlanta, Georgia and Dort Mutzel, Technische Universität Dortmund, Dortmund, Germany
ISBN (Print): 978-1-611972-12-2
ISBN (Online): 978-1-61197-292-4

History

Published online: 18 December 2013

Authors

Affiliations

Metrics & Citations

Metrics

Citations

If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.

Cited By

There are no citations for this item

View Options

View options

PDF

View PDF

Get Access

Media

Figures

Other

Tables

Share

Share

Copy the content Link

Share with email

Email a colleague

Share on social media

The SIAM Publications Library now uses SIAM Single Sign-On for individuals. If you do not have existing SIAM credentials, create your SIAM account https://my.siam.org.