%0 Conference Paper
%B Kalmàr Workshop on Logic and Computer Science
%D 2003
%T A new permutation model for solving the graph k-coloring problem
%A Juhos, I.
%A Tóth, A.
%A Tezuka, M.
%A Tann, P.
%A van Hemert, J. I.
%K constraint satisfaction
%K graph colouring
%X 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.
%B Kalmàr Workshop on Logic and Computer Science
%P 189--199
%G eng
%9 inproceedings