Distributed Evolutionary Graph Partitioning

Details Distributed Evolutionary Graph Partitioning Distributed Evolutionary Graph Partitioning

2011-10-03

arxiv.org/abs/1110.0477v1

Computer Science

Neural and Evolutionary Computing

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Distributed Evolutionary Graph Partitioning does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Distributed Evolutionary Graph Partitioning, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Distributed Evolutionary Graph Partitioning will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-266939