graph coloring

(redirected from Graph colouring problems)

graph coloring

References in periodicals archive ?
He presented a comparison of two grouping approaches for graph colouring problems.
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.
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.