当前位置: X-MOL 学术ACM Comput. Surv. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
More Recent Advances in (Hyper)Graph Partitioning
ACM Computing Surveys ( IF 23.8 ) Pub Date : 2023-03-02 , DOI: 10.1145/3571808
Ümit V. Çatalyürek 1 , Karen D. Devine 2 , Marcelo Fonseca Faraj 3 , Lars Gottesbüren 4 , Tobias Heuer 4 , Henning Meyerhenke 5 , Peter Sanders 4 , Sebastian Schlag 6 , Christian Schulz 3 , Daniel Seemaier 4 , Dorothea Wagner 4
Affiliation  

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.



中文翻译:

(超)图分区的最新进展

近年来,平衡(超)图划分算法的设计和评估取得了重大进展。我们调查了过去十年平衡(超)图划分实用算法的趋势以及未来的研究方向。我们的工作是对先前关于该主题 [29] 的调查的更新。特别是,该调查扩展了之前的调查,还涵盖了超图划分,并额外关注了并行算法。

更新日期:2023-03-02
down
wechat
bug