Parallel unconstrained local search for partitioning irregular graphs

DOI10.1137/1.9781611977929.3MaRDI QIDQ6545382zbMATH OpenFDO

Authors Lars Gottesbüren, Daniel Seemaier

Publication date 29 May 2024

Full work available at URL https://doi.org/10.1137/1.9781611977929.3

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Recommendations

• scientific article; zbMATH DE number 7286677
• Engineering multilevel graph partitioning algorithms
• ILP-Based Local Search for Graph Partitioning
• scientific article; zbMATH DE number 177834

Cited in

(1)

• Linear-time multilevel graph partitioning via edge sparsification

This page was built for publication: Parallel unconstrained local search for partitioning irregular graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6545382)