Distributed Evolutionary Graph Partitioning

DOI10.1137/1.9781611972924.2zbMath1430.68237arXiv1110.0477OpenAlexW2963577143MaRDI QIDQ5233714

Peter Sanders, Christian Schulz

Publication date: 12 September 2019

Published in: 2012 Proceedings of the Fourteenth Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1110.0477

Mathematics Subject Classification ID

Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distributed algorithms (68W15)

Related Items (9)

Reconfiguration of connected graph partitions ⋮ Fission: Practical algorithms for computing minimum balanced node separators ⋮ An exact approach for the multi-constraint graph partitioning problem ⋮ An exact combinatorial algorithm for minimum graph bisection ⋮ A bounded-error quantum polynomial-time algorithm for two graph bisection problems ⋮ Energy-optimal routes for battery electric vehicles ⋮ Advanced Coarsening Schemes for Graph Partitioning ⋮ Unnamed Item ⋮ Memetic Graph Clustering

Uses Software

• KaFFPa
• KaHIP

This page was built for publication: Distributed Evolutionary Graph Partitioning