Proceedings
2012 Proceedings of the Fourteenth Workshop on Algorithm Engineering and Experiments (ALENEX)
Distributed Evolutionary Graph Partitioning
Pages 16 - 29
Abstract
We present a novel distributed evolutionary algorithm, KaFFPaE, to solve the Graph Partitioning Problem, which makes use of KaFFPa (Karlsruhe Fast Flow Partitioner). The use of our multilevel graph partitioner KaFFPa provides new effective crossover and mutation operators. By combining these with a scalable communication protocol we obtain a system that is able to improve the best known partitioning results for many inputs in a very short amount of time. For example, in Walshaw's well known benchmark tables we are able to improve or recompute 76% of entries for the tables with 1%, 3% and 5% imbalance.
Formats available
You can view the full content in the following formats:
Information & Authors
Information
Published In
2012 Proceedings of the Fourteenth Workshop on Algorithm Engineering and Experiments (ALENEX)
Pages: 16 - 29
Editors: David A. Bader, Georgia Institute of Technology, Atlanta, Georgia and Dort Mutzel, Technische Universität Dortmund, Dortmund, Germany
ISBN (Print): 978-1-611972-12-2
ISBN (Online): 978-1-61197-292-4
Copyright
© 2012 by the Society for Industrial and Applied Mathematics.
History
Published online: 18 December 2013
Authors
Metrics & Citations
Metrics
Citations
If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.
Cited By
- Optimizing Connected Components Graph Partitioning With Minimum Size Constraints Using Integer Programming and Spectral Clustering TechniquesNetworks, Vol. 85, No. 3 | 10 November 2024
- Dual Clustering-Based Method for Geospatial Knowledge Graph PartitioningApplied Sciences, Vol. 14, No. 22 | 19 November 2024
- Task Scheduling in Multi-Cloud Environments: A Graph Partitioning Approach Enhanced by Nested Genetic Algorithms2024 11th International Conference on Internet of Things: Systems, Management and Security (IOTSMS) | 2 Sep 2024
- Distributed Pose-Graph Optimization With Multi-Level Partitioning for Multi-Robot SLAMIEEE Robotics and Automation Letters, Vol. 9, No. 6 | 1 Jun 2024
- Scalable High-Quality Hypergraph PartitioningACM Transactions on Algorithms, Vol. 20, No. 1 | 22 January 2024
- Task Allocation with Geography-Context-Capacity Awareness in Distributed Burstable Billing Edge-Cloud SystemsIEEE Transactions on Services Computing, Vol. 127 | 1 Jan 2024
- A Distributed Multilevel Memetic Algorithm for Signed Graph ClusteringProceedings of the Companion Conference on Genetic and Evolutionary Computation | 24 July 2023
- VSCT algorithm for graph partitioning based on volume, size, cuts and timeInternational Journal of Parallel, Emergent and Distributed Systems, Vol. 38, No. 3 | 13 February 2023
- Un Método Exacto para el Problema de Equiparticionamiento de Grafos en Componentes ConexasRevista Politécnica, Vol. 51, No. 1 | 2 February 2023
- Reconfiguration of connected graph partitionsJournal of Graph Theory, Vol. 102, No. 1 | 1 July 2022
- Adaptive Partitioning for Distributed Multi-Agent SimulationsProceedings of the 2022 ACM SIGSIM Conference on Principles of Advanced Discrete Simulation | 10 June 2022
- MUSE: Multimodal Separators for Efficient Route Planning in Transportation NetworksTransportation Science, Vol. 56, No. 2 | 1 Mar 2022
- OLPGP: An Optimized Label Propagation-Based Distributed Graph Partitioning AlgorithmData Mining and Big Data | 20 January 2023
- Adapting k-means for graph clusteringKnowledge and Information Systems, Vol. 64, No. 1 | 4 December 2021
- Distributed Application Global States Monitoring in PEGASUS DA Applied to Parallel Graph PartitioningConcurrency and Computation: Practice and Experience, Vol. 33, No. 11 | 13 October 2020
- An MPI-based Algorithm for Mapping Complex Networks onto Hierarchical ArchitecturesEuro-Par 2021: Parallel Processing | 25 August 2021
- An exact approach for the multi-constraint graph partitioning problemEURO Journal on Computational Optimization, Vol. 8, No. 3-4 | 1 Oct 2020
- Energy-Optimal Routes for Battery Electric VehiclesAlgorithmica, Vol. 82, No. 5 | 3 December 2019
- Vienna Graph ClusteringProtein-Protein Interaction Networks | 4 October 2019
- Parallel Graph Partitioning Optimization Under PEGASUS DA Application Global State MonitoringParallel Processing and Applied Mathematics | 19 March 2020
- FISSION: A Practical Algorithm for Computing Minimum Balanced Node SeparatorsCombinatorial Optimization and Applications | 4 December 2020
- Evolutionary $n$ -Level Hypergraph Partitioning With Adaptive CoarseningIEEE Transactions on Evolutionary Computation, Vol. 23, No. 6 | 1 Dec 2019
- Faster and Better Nested Dissection Orders for Customizable Contraction HierarchiesAlgorithms, Vol. 12, No. 9 | 16 September 2019
- Parallel Heuristics for Balanced Graph Partitioning Based on Richness of Implicit KnowledgeIEEE Access, Vol. 7 | 1 Jan 2019
- Parallel Graph Partitioning for Complex NetworksIEEE Transactions on Parallel and Distributed Systems, Vol. 28, No. 9 | 1 Sep 2017
- Cost-Effective Social Network Data Placement and Replication Using Graph-Partitioning2017 IEEE International Conference on Cognitive Computing (ICCC) | 1 Jun 2017
- Fast Exact Computation of Isochrones in Road NetworksExperimental Algorithms | 1 June 2016
- Dynamic Time-Dependent Route Planning in Road Networks with User PreferencesExperimental Algorithms | 1 June 2016
- Route Planning in Transportation NetworksAlgorithm Engineering | 11 November 2016
- Recent Advances in Graph PartitioningAlgorithm Engineering | 11 November 2016
- An exact combinatorial algorithm for minimum graph bisectionMathematical Programming, Vol. 153, No. 2 | 10 September 2014
- A bounded-error quantum polynomial-time algorithm for two graph bisection problemsQuantum Information Processing, Vol. 14, No. 9 | 14 July 2015
- Parallel Graph Partitioning for Complex Networks2015 IEEE International Parallel and Distributed Processing Symposium | 1 May 2015
- K-Ways Partitioning of Polyhedral Process Networks: A Multi-level Approach2015 IEEE International Parallel and Distributed Processing Symposium Workshop | 1 May 2015
- On Balanced Separators in Road NetworksExperimental Algorithms | 20 June 2015
- VSEP: A Distributed Algorithm for Graph Edge PartitioningAlgorithms and Architectures for Parallel Processing | 29 December 2015
- Distributed Vertex-Cut PartitioningDistributed Applications and Interoperable Systems | 1 Jan 2014
- GRASP. Extending Graph Separators for the Single-Source Shortest-Path ProblemAlgorithms - ESA 2014 | 1 Jan 2014
- JA-BE-JA: A Distributed Algorithm for Balanced Graph Partitioning2013 IEEE 7th International Conference on Self-Adaptive and Self-Organizing Systems | 1 Sep 2013
- Multi-threaded Graph Partitioning2013 IEEE 27th International Symposium on Parallel and Distributed Processing | 1 May 2013
- Think Locally, Act Globally: Highly Balanced Graph PartitioningExperimental Algorithms | 1 Jan 2013
- Very Large Graph Partitioning by Means of Parallel DBMSAdvances in Databases and Information Systems | 1 Jan 2013
- Better Bounds for Graph BisectionAlgorithms – ESA 2012 | 1 Jan 2012
View Options
View options
- Access via your Institution
- Questions about how to access this content? Contact SIAM at [email protected].