More Recent Advances in (Hyper)Graph Partitioning
More Recent Advances in (Hyper)Graph Partitioning
复制标题
DOI：
10.1145/3571808
复制
发表时间：
2022-05
影响因子：
16.6
通讯作者：
Umit V. cCatalyurek;K. Devine;Marcelo Fonseca Faraj;Lars Gottesburren;Tobias Heuer;Henning Meyerhenke;P. Sanders;Sebastian Schlag;Christian Schulz;Daniel Seemaier;D. Wagner
中科院分区：
文献类型：
--
作者：
Umit V. cCatalyurek;K. Devine;Marcelo Fonseca Faraj;Lars Gottesburren;Tobias Heuer;Henning Meyerhenke;P. Sanders;Sebastian Schlag;Christian Schulz;Daniel Seemaier;D. Wagner
近年来，在平衡(超)图划分算法的设计和评价方面取得了重大进展。我们回顾了过去十年来平衡(超)图划分实用算法的发展趋势以及未来的研究方向。我们的工作是对以前关于这个主题的调查的更新[29]。特别是，这项调查扩展了之前的调查，还涵盖了超图划分，并额外关注了并行算法。
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.