An application of a new hybrid genetic algorithm to graph coloring

MaRDI QIDQ3501146zbMATH OpenFDO

Authors Li Cao, Hao Cheng, Zhong Xu

Publication date 3 June 2008

zbMATH Keywords

genetic algorithmadaptive SA operatorGA-ASATStabu operator

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Algorithms in computer science (68W99)

Recommendations

• Genetic and hybrid algorithms for graph coloring
• A hybrid algorithm of simulated annealing and tabu search for graph colouring problem
• Hybrid evolutionary algorithms for graph coloring
• A hybrid algorithm for the robust graph coloring problem
• Efficient graph coloring with parallel genetic algorithms

Cited in

(10)

• Graph \(k\)-colorability using a threshold accepting and Davis-Putnam hybrid algorithm
• Genetic and hybrid algorithms for graph coloring
• A new DNA algorithm to solve graph coloring problem
• An efficient hybrid genetic hill-climbing algorithm for solving \(n\)-region 4-coloring map problems
• scientific article; zbMATH DE number 2013463 (Why is no real title available?)
• Hybrid evolutionary algorithms for graph coloring
• An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring
• A hybrid algorithm for the robust graph coloring problem
• A hybrid algorithm of simulated annealing and tabu search for graph colouring problem
• AI 2003: Advances in Artificial Intelligence

Describes a project that uses

Uses Software

• DSATUR

This page was built for publication: An application of a new hybrid genetic algorithm to graph coloring

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