An efficient approach for large scale graph partitioning

DOI10.1007/s10878-006-9026-4zbMath1130.05047OpenAlexW1988619335MaRDI QIDQ2467568

Renzo Z. Loureiro, André R. S. Amaral

Publication date: 22 January 2008

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-006-9026-4

zbMATH Keywords

Graph partitioningWorkload balancingGreedy heuristics

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Approximation methods and heuristics in mathematical programming (90C59) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Uses Software

• MESHPART

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Multilevel refinement for combinatorial optimisation problems
• A combined evolutionary search and multilevel optimisation approach to graph-partitioning
• On the validity of a front-oriented approach to partitioning large sparse graphs with a connectivity constraint
• Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
• An Efficient Heuristic Procedure for Partitioning Graphs
• How Good is Recursive Bisection?
• Genetic algorithm and graph partitioning
• Mesh Partitioning: A Multilevel Balancing and Refinement Algorithm
• An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations

This page was built for publication: An efficient approach for large scale graph partitioning