An ordering-based genetic approach to graph coloring

MaRDI QIDQ5457702zbMATH OpenFDO

Authors Cornelius Croitoru, Ovidiu Gheorghies, Adriana Gheorghieş

Publication date 14 April 2008

zbMATH Keywords

genetic algorithmgenetic operatorsgraph coloring problem

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Randomized algorithms (68W20)

Recommendations

• Two novel evolutionary formulations of the graph coloring problem
• Graph coloring with adaptive evolutionary algorithms
• Solving Scheduling Problems by Evolutionary Algorithms for Graph Coloring Problem
• scientific article; zbMATH DE number 1342294
• Hybrid evolutionary algorithms for graph coloring

Cited in

(8)

• A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing
• Graph coloring with adaptive evolutionary algorithms
• Two novel evolutionary formulations of the graph coloring problem
• Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm
• A new DNA algorithm to solve graph coloring problem
• scientific article; zbMATH DE number 2076933 (Why is no real title available?)
• The \(k\)-coloring fitness landscape
• Breaking the search space symmetry in partitioning problems: an application to the graph coloring problem

This page was built for publication: An ordering-based genetic approach to graph coloring

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