[PDF][PDF] Tera-Scale Multilevel Graph Partitioning
D Salwasser, D Seemaier, L Gottesbüren… - arXiv preprint arXiv …, 2024 - arxiv.org
We present TeraPart, a memory-efficient multilevel graph partitioning method that is
designed to scale to extremely large graphs. In balanced graph partitioning, the goal is to …
designed to scale to extremely large graphs. In balanced graph partitioning, the goal is to …
Brief Announcement: Distributed Unconstrained Local Search for Multilevel Graph Partitioning
P Sanders, D Seemaier - Proceedings of the 36th ACM Symposium on …, 2024 - dl.acm.org
Partitioning a graph into blocks of roughly equal weight while cutting only few edges is a
fundamental problem in computer science with numerous practical applications. While …
fundamental problem in computer science with numerous practical applications. While …
Modern Software Libraries for Graph Partitioning
We summarize recent developments in parallel libraries for balanced graph partitioning,
spanning contributions made over several research papers~\citeMT-KAHYPAR-D, MT …
spanning contributions made over several research papers~\citeMT-KAHYPAR-D, MT …
[PDF][PDF] Optimizing a Parallel Graph Partitioner for Memory Efficiency
D Salwasser - 2024 - ae.iti.kit.edu
Graph partitioning is a classical NP-hard optimization problem with a wide range of practical
applications. The problem is to divide the nodes of a graph into balanced blocks such that …
applications. The problem is to divide the nodes of a graph into balanced blocks such that …