[{"type":"paper-conference","title":"Engineering Graph Partitioning Algorithms","issued":{"date-parts":[["2012"]]},"page":"18\u201326","container-title":"Experimental Algorithms. Ed.: R. Klasing","DOI":"10.1007\/978-3-642-30850-5_3","author":[{"family":"Osipov","given":"Vitaly"},{"family":"Sanders","given":"Peter"},{"family":"Schulz","given":"Christian"}],"publisher":"Springer","publisher-place":"Berlin","ISBN":"978-3-642-30850-5","ISSN":"0302-9743, 1611-3349","collection-title":"Lecture Notes in Computer Science","abstract":"The paper gives an overview of our recent work on balanced graph partitioning \u2013 partition the nodes of a graph into k blocks such that all blocks have approximately equal size and such that the number of cut edges is small. This problem has numerous applications for example in parallel processing. We report on a scalable parallelization and a number of improvements on the classical multi-level approach which leads to improved partitioning quality. This includes an integration of flow methods, improved local search, several improved coarsening schemes, repeated runs similar to the approaches used in multigrid solvers, and an integration into a distributed evolutionary algorithm. Overall this leads to a system that for many common benchmarks leads to both the best quality solution known and favorable tradeoffs between running time and solution quality.","kit-publication-id":"1000097639"}]