Discrete mathematics

Hypergraph

Theoretical computer science

Computer science

Physics

Graph

Mathematics

Optics

Focus (optics)

Data science

Graph partition

ACM Computing Surveys

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.

More Recent Advances in (Hyper)Graph Partitioning