graph coloring

(redirected from Colouring problem)
Also found in: Wikipedia.

graph coloring

References in periodicals archive ?
A number of commonly used strategies have been adopted from the graph colouring problem.
The use of Saturation Degree was first presented by Bfelaz (1979) for the graph colouring problem.
One of the earliest papers that applied this approach to the graph colouring problem was published by Wood (1969).
In comparison to the best results in literature for the benchmark data sets, they obtained competitive results for the graph colouring problem and uncapacitated problem, while for the the capacitated problem they produced best results for several problem instances.
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.
Andrea Schaerf and Luca Di Gaspero [1], reduced the exam timetabling problem into a graph colouring problem.