Multilevel heuristic algorithm for graph partitioning

DOI10.1007/3-540-36605-9_14MaRDI QIDQ4418373zbMATH OpenFDO

Authors Raul Baños, Consolación Gil, J. Ortega, Francisco G. Montoya

Publication date 10 August 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2611/26110143.htm

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• An effective multilevel tabu search approach for balanced graph partitioning
• Artificial Evolution
• A combined evolutionary search and multilevel optimisation approach to graph-partitioning
• Multilevel graph partitioning: an evolutionary approach
• New heuristic solution procedures for the uniform graph partitioning problem: Extensions and evaluation

Cited in

(8)

• A multi-level hypergraph partitioning algorithm using rough set clustering
• A combined evolutionary search and multilevel optimisation approach to graph-partitioning
• Analysis of divide-and-conquer strategies for the 0-1 minimization knapsack problem
• An Effective Refinement Algorithm Based on Swarm Intelligence for Graph Bipartitioning
• \(D^{3}G^{2}A\): the dynamic distributed double guided genetic algorithm for the \(K\)-graph partitioning problem
• scientific article; zbMATH DE number 66966 (Why is no real title available?)
• An effective multilevel tabu search approach for balanced graph partitioning
• An efficient memetic algorithm for the graph partitioning problem

Describes a project that uses

Uses Software

• MESHPART

This page was built for publication: Multilevel heuristic algorithm for graph partitioning

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