EUVIMEDEUVIMED entdecken
Crossref

More Recent Advances in (Hyper)Graph Partitioning

Ümit Çatalyürek, Karen Devine, Marcelo Faraj, Lars Gottesbüren, Tobias Heuer, Henning Meyerhenke, Peter Sanders, Sebastian Schlag, Christian Schulz, Daniel Seemaier, Dorothea Wagner

ACM Computing Surveys · 31.12.2023 · 55 (12) · 1-38

DOI: 10.1145/3571808 ↗

Kurz gefasst

Fachartikel in der Zeitschrift ACM Computing Surveys, online erschienen am 02.03.2023. Verfasst von Ümit Çatalyürek und 10 weiteren Autor:innen. Die Arbeit wurde bisher 79-mal zitiert (Crossref) und nennt 194 Literaturangaben. Gefördert von: DFG, NSF.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

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.

Förderung

  • DFG
  • NSF

Zitieren

APA

Çatalyürek, Ü., Devine, K., Faraj, M., Gottesbüren, L., Heuer, T., Meyerhenke, H., Sanders, P., Schlag, S., Schulz, C., Seemaier, D., & Wagner, D. (2023). More Recent Advances in (Hyper)Graph Partitioning. ACM Computing Surveys, 55(12), 1-38. https://doi.org/10.1145/3571808

Vancouver

Çatalyürek Ü, Devine K, Faraj M, Gottesbüren L, Heuer T, Meyerhenke H, et al. More Recent Advances in (Hyper)Graph Partitioning. ACM Computing Surveys. 2023;55(12):1-38. doi:10.1145/3571808

BibTeX
@article{atalyrek2023,
  author = {Çatalyürek, Ümit and Devine, Karen and Faraj, Marcelo and Gottesbüren, Lars and Heuer, Tobias and Meyerhenke, Henning and Sanders, Peter and Schlag, Sebastian and Schulz, Christian and Seemaier, Daniel and Wagner, Dorothea},
  title = {More Recent Advances in (Hyper)Graph Partitioning},
  journal = {ACM Computing Surveys},
  year = {2023},
  volume = {55},
  number = {12},
  pages = {1--38},
  doi = {10.1145/3571808}
}
Kostenlos starten →