The Internet Archive has a preservation copy of this work in our general collections.
The file type is
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 tablesarXiv:1012.0006v3 fatcat:7a4cq7jjhvbfnc6bifuqjpfeea