More Recent Advances in (Hyper)Graph Partitioning

Ümit V. Çatalyürek

doi:10.1145/3571808

More Recent Advances in (Hyper)Graph Partitioning

2023-03-02

20

OA

AI

Marcelo Fonseca Faraj

DOI：10.1145/3571808

Original request for help

Save

Abstract

En 中文

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.

Keywords:

Graph partitioning

hypergraph partitioning

load balancing

More Recent Advances in (Hyper)Graph Partitioning

Abstract

Journal

Organization