TY - CONF
T1 - Binary Merge Model Representation of the Graph Colouring Problem
T2 - Springer Lecture Notes on Computer Science
Y1 - 2004
A1 - Juhos, I.
A1 - Tóth, A.
A1 - van Hemert, J. I.
ED - J. Gottlieb
ED - G. Raidl
KW - constraint satisfaction
KW - graph colouring
AB - 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.
JF - Springer Lecture Notes on Computer Science
PB - Springer-Verlag, Berlin
SN - 3-540-21367-8
ER -