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. © 2010 Springer-Verlag.
CITATION STYLE
Osipov, V., & Sanders, P. (2010). n-Level graph partitioning. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6346 LNCS, pp. 278–289). https://doi.org/10.1007/978-3-642-15775-2_24
Mendeley helps you to discover research relevant for your work.