More Recent Advances in (Hyper)Graph Partitioning
It provides a comprehensive overview for researchers and practitioners in computational fields, but is incremental as a survey update.
This paper surveys recent advances in balanced (hyper)graph partitioning algorithms over the last decade, serving as an update to a previous survey by covering hypergraph partitioning, streaming algorithms, and parallel algorithms.
In recent years, significant advances have been made in the design and evaluation of balanced (hyper)graph partitioning algorithms. We survey trends of the last 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. In particular, the survey extends the previous survey by also covering hypergraph partitioning and streaming algorithms, and has an additional focus on parallel algorithms.