Engineering Multilevel Graph Partitioning Algorithms release_njfrwt6t55hwjfwm27cqgyzi4e

by Peter Sanders, Christian Schulz

Released as a article .

2010  

Abstract

We present a multi-level graph partitioning algorithm using novel local improvement algorithms and global search strategies transferred from the multi-grid community. Local improvement algorithms are based max-flow min-cut computations and more localized FM searches. By combining these techniques, we obtain an algorithm that is fast on the one hand and on the other hand is able to improve the best known partitioning results for many inputs. For example, in Walshaw's well known benchmark tables we achieve 317 improvements for the tables 1%, 3% and 5% imbalance. Moreover, in 118 additional cases we have been able to reproduce the best cut in this benchmark.
In text/plain format

Archived Files and Locations

application/pdf  416.6 kB
file_zi7wblalxbbhfpejyfdxhyvayy
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2010-11-30
Version   v1
Language   en ?
arXiv  1012.0006v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 41de4037-6d1c-4907-aee3-d4e56e817f57
API URL: JSON