Cover Image

More recent advances in (hyper)graph partitioning

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 updat...

Full description

Saved in:
Bibliographic Details
Main Authors: Çatalyürek, Ümit (Author) , Devine, Karen (Author) , Fonseca Faraj, Marcelo (Author) , Gottesbüren, Lars (Author) , Heuer, Tobias (Author) , Meyerhenke, Henning (Author) , Sanders, Peter (Author) , Schlag, Sebastian (Author) , Schulz, Christian (Author) , Seemaier, Daniel (Author) , Wagner, Dorothea (Author)
Format: Article (Journal)
Language:English
Published: 02 March 2023
In: ACM computing surveys
Year: 2023, Volume: 55, Issue: 12, Pages: 1-38
ISSN:1557-7341
DOI:10.1145/3571808
Online Access:Verlag, lizenzpflichtig, Volltext: https://doi.org/10.1145/3571808
Get full text
Author Notes:Ümit Çatalyürek, Karen Devine, Marcelo Faraj, Lars Gottesbüren, Tobias Heuer, Henning Meyerhenke, Peter Sanders, Sebastian Schlag, Christian Schulz, Daniel Seemaier, Dorothea Wagner
Description
Summary: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.
Item Description:Gesehen am 05.06.2023
Physical Description:Online Resource
ISSN:1557-7341
DOI:10.1145/3571808

Similar Items