n-Level Graph Partitioning

Details n-Level Graph Partitioning n-Level Graph Partitioning

2010-04-22

arxiv.org/abs/1004.4024v1

Computer Science

Data Structures and Algorithms

Scientific paper

We present a multi-level graph partitioning algorithm based on the extreme idea to contract only a single edge on each level of the hierarchy. This obviates the need for a matching algorithm and promises very good partitioning quality since there are very few changes between two levels. Using an efficient data structure and new flexible ways to break local search improvements early, we obtain an algorithm that scales to large inputs and produces the best known partitioning results for many inputs. For example, in Walshaw's well known benchmark tables we achieve 155 improvements dominating the entries for large graphs.

Affiliated with

Also associated with

No associations

Rating

n-Level 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 n-Level Graph Partitioning, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and n-Level Graph Partitioning will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-693643