%0 Conference Paper
%B Springer Lecture Notes on Computer Science
%D 2004
%T Binary Merge Model Representation of the Graph Colouring Problem
%A Juhos, I.
%A Tóth, A.
%A van Hemert, J. I.
%E J. Gottlieb
%E G. Raidl
%K constraint satisfaction
%K graph colouring
%X This paper describes a novel representation and ordering model that aided by an evolutionary algorithm, is used in solving the graph \emph{k}-colouring problem. Its strength lies in reducing the search space by breaking symmetry. An empirical comparison is made with two other algorithms on a standard suit of problem instances and on a suit of instances in the phase transition where it shows promising results.
%B Springer Lecture Notes on Computer Science
%I Springer-Verlag, Berlin
%P 124--134
%@ 3-540-21367-8
%G eng
%9 inproceedings