TY - CONF
T1 - A new permutation model for solving the graph k-coloring problem
T2 - Kalmàr Workshop on Logic and Computer Science
Y1 - 2003
A1 - Juhos, I.
A1 - Tóth, A.
A1 - Tezuka, M.
A1 - Tann, P.
A1 - van Hemert, J. I.
KW - constraint satisfaction
KW - graph colouring
AB - This paper describes a novel representation and ordering model, that is aided by an evolutionary algorithm, is used in solving the graph k-coloring. A comparison is made between the new representation and an improved version of the traditional graph coloring technique DSATUR on an extensive list of graph k-coloring problem instances with different properties. The results show that our model outperforms the improved DSATUR on most of the problem instances.
JF - Kalmàr Workshop on Logic and Computer Science
ER -