More Recent Advances in (Hyper)Graph Partitioning

05/26/2022
by   Umit V. Catalyurek, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/13/2023

FREIGHT: Fast Streaming Hypergraph Partitioning

Partitioning the vertices of a (hyper)graph into k roughly balanced bloc...
research
09/29/2021

Partitioning Cloud-based Microservices (via Deep Learning)

Cloud-based software has many advantages. When services are divided into...
research
02/22/2021

Recent Advances in Fully Dynamic Graph Algorithms

In recent years, significant advances have been made in the design and a...
research
12/23/2020

Recent Advances in Practical Data Reduction

Over the last two decades, significant advances have been made in the de...
research
10/19/2021

A survey on active noise control techniques – Part II: Nonlinear systems

Part I of this paper reviewed the development of the linear active noise...
research
08/29/2023

Streaming, Local, and Multi-Level (Hyper)Graph Decomposition

(Hyper)Graph decomposition is a family of problems that aim to break dow...
research
07/06/2020

Prioritized Restreaming Algorithms for Balanced Graph Partitioning

Balanced graph partitioning is a critical step for many large-scale dist...

Please sign up or login with your details

Forgot password? Click here to reset