An efficient approach for large scale graph partitioning

DOI10.1007/S10878-006-9026-4MaRDI QIDQ2467568zbMATH OpenOpenAlexFDO

Authors 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 partitioningGreedy heuristicsWorkload balancing

Mathematics Subject Classification ID

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

Recommendations

• A New Heuristic for Partitioning the Nodes of a Graph
• scientific article; zbMATH DE number 910878
• Path optimization for graph partitioning problems
• On the validity of a front-oriented approach to partitioning large sparse graphs with a connectivity constraint
• An experimental evaluation of local search heuristics for graph partitioning

Cites work

• A combined evolutionary search and multilevel optimisation approach to graph-partitioning
• An Efficient Heuristic Procedure for Partitioning Graphs
• An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations
• Genetic algorithm and graph partitioning
• How Good is Recursive Bisection?
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1054945 (Why is no real title available?)
• scientific article; zbMATH DE number 1163705 (Why is no real title available?)
• Mesh Partitioning: A Multilevel Balancing and Refinement Algorithm
• Multilevel refinement for combinatorial optimisation problems
• 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

Cited in

(11)

• Lock-gain based graph partitioning
• A stochastic heuristic visualising graph clusters in a bi-dimensional space prior to partitioning
• On the validity of a front-oriented approach to partitioning large sparse graphs with a connectivity constraint
• A heuristic method for solving the problem of partitioning graphs with supply and demand
• Very cost effective bipartitions in graphs
• A New Heuristic for Partitioning the Nodes of a Graph
• scientific article; zbMATH DE number 1942408 (Why is no real title available?)
• A novel graph-based partitioning algorithm for large-scale dynamical systems
• Optimizing streaming graph partitioning via a heuristic greedy method and caching strategy
• Iterated multilevel simulated annealing for large-scale graph conductance minimization
• Graph partitioning: an updated survey

Describes a project that uses

Uses Software

• MESHPART

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

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