More Recent Advances in (Hyper)Graph Partitioning
Ümit V. Çatalyürek, Karen Devine, Marcelo Fonseca Faraj, Lars Gottesbüren, Tobias Heuer, Henning Meyerhenke, Peter Sanders, Sebastian Schlag, Christian Schulz, Daniel Seemaier, Dorothea Wagner
Abstract
In recent years, significant advances have been made in the design and evaluation of balanced (hyper)graph partitioning algorithms. We survey trends of the past decade in practical algorithms for balanced (hyper)graph partitioning together with future research directions. Our work serves as an update to a previous survey on the topic [ 29 ]. In particular, the survey extends the previous survey by also covering hypergraph partitioning and has an additional focus on parallel algorithms.
Topics & Concepts
Computer scienceHypergraphGraph partitionTheoretical computer scienceGraphFocus (optics)Data scienceMathematicsDiscrete mathematicsOpticsPhysicsVLSI and FPGA Design TechniquesInterconnection Networks and SystemsEmbedded Systems Design Techniques