More Recent Advances in (Hyper)Graph Partitioning-Reference-Cited by-同舟云学术

More Recent Advances in (Hyper)Graph Partitioning

Published:2023-03-02 Issue:12 Volume:55 Page:1-38
ISSN:0360-0300
Container-title:ACM Computing Surveys
language:en
Short-container-title:ACM Comput. Surv.

Author:

Çatalyürek Ümit¹^ORCID,Devine Karen²^ORCID,Faraj Marcelo³^ORCID,Gottesbüren Lars⁴^ORCID,Heuer Tobias⁴^ORCID,Meyerhenke Henning⁵^ORCID,Sanders Peter⁴^ORCID,Schlag Sebastian⁶^ORCID,Schulz Christian³^ORCID,Seemaier Daniel⁴^ORCID,Wagner Dorothea⁴^ORCID

Affiliation:

1. Georgia Institute of Technology, Atlanta, GA, United States of America

2. Sandia National Laboratories, ret., Albuquerque, NM, United States of America

3. Heidelberg University, Baden-Württemberg, Germany

4. Karlsruhe Institute of Technology, Baden-Württemberg, Germany

5. Humboldt-Universität zu Berlin, Berlin, Germany

6. Apple Inc., Cupertino, CA, United States of America

Abstract

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.

Funder

DFG

NSF

Publisher

Association for Computing Machinery (ACM)

Subject

General Computer Science,Theoretical Computer Science

Link

https://dl.acm.org/doi/pdf/10.1145/3571808

Reference194 articles.

1. Sphynx: A parallel multi-GPU graph partitioner for distributed-memory systems

2. Seher Acer, Erik G. Boman, and Sivasankaran Rajamanickam. 2020. SPHYNX: Spectral partitioning for hybrid and axelerator-enabled systems. In Proceedings of the IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW’20). 440–449. 10.1109/IPDPSW50202.2020.00082

3. Yaroslav Akhremtsev, Tobias Heuer, Peter Sanders, and Sebastian Schlag. 2017. Engineering a direct k-way hypergraph partitioning algorithm. In Proceedings of the 19th Workshop on Algorithm Engineering and Experiments (ALENEX’17). SIAM, 28–42. 10.1137/1.9781611974768.3

4. High-Quality Shared-Memory Graph Partitioning

5. Charles J. Alpert. 1998. The ISPD98 circuit benchmark suite. In Proceedings of the International Symposium on Physical Design (ISPD’98), Majid Sarrafzadeh (Ed.). ACM, 80–85. 10.1145/274535.274546

Cited by 27 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Distributed algorithm for parallel computation of the n queens solutions;Expert Systems with Applications;2024-12

2. Distance Enhanced Hypergraph Learning for Dynamic Node Classification;Neural Processing Letters;2024-09-09

3. Fuzzy Clustering From Subset-Clustering to Fullset-Membership;IEEE Transactions on Fuzzy Systems;2024-09

4. A Recursive Partitioning Approach to Improving Hypergraph Partitioning;2024 IEEE Canadian Conference on Electrical and Computer Engineering (CCECE);2024-08-06

5. A Comprehensive Survey on Graph Summarization With Graph Neural Networks;IEEE Transactions on Artificial Intelligence;2024-08