graph coloring

(redirected from Graph colouring problems)

graph coloring

This article is provided by FOLDOC - Free Online Dictionary of Computing (foldoc.org)
References in periodicals archive ?
Erben (2001) pointed out that the poor performance of GAs (compared to conventional heuristic approaches) in graph colouring problems was primarily because of the inappropriate selection of solution encoding schemes.
A study by Costa and Hertz (1997) investigated the use of Ant Colony Optimisation in graph colouring problems in which they called their ant system ANTCOL.
One of the earliest papers that applied this approach to the graph colouring problem was published by Wood (1969).
Graph Colouring Problems, chapter 4.9, pages 86-89.