A cooperative search method for the \(k\)-coloring problem

DOI10.1007/s10852-008-9081-1zbMath1139.05343OpenAlexW4301383419MaRDI QIDQ928692

Hend Bouziri, Khaled Mellouli, El-Ghazali Talbi

Publication date: 11 June 2008

Published in: JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10852-008-9081-1

zbMATH Keywords

fitness landscapeiterative searchcooperative method

Mathematics Subject Classification ID

Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Using tabu search techniques for graph coloring
• Some experiments with simulated annealing for coloring graphs
• STABULUS: A technique for finding stable sets in large graphs with tabu search
• Local optima topology for the \(k\)-coloring problem
• Genetic and hybrid algorithms for graph coloring
• Hybrid evolutionary algorithms for graph coloring
• An adaptive memory algorithm for the \(k\)-coloring problem
• A survey of local search methods for graph coloring
• Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
• New methods to color the vertices of a graph
• Frozen development in graph coloring

This page was built for publication: A cooperative search method for the \(k\)-coloring problem