01019nas a2200205 4500008004100000020001800041245006900059210006900128260002800197300001300225520041700238653002800655653002000683100001300703700001300716700001600729700001600745700001300761856003900774 2004 eng d a3-540-21367-800aBinary Merge Model Representation of the Graph Colouring Problem0 aBinary Merge Model Representation of the Graph Colouring Problem bSpringer-Verlag, Berlin a124--1343 aThis 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.10aconstraint satisfaction10agraph colouring1 aJuhos, I1 aTÃ³th, A1 aHemert, J I1 aGottlieb, J1 aRaidl, G uhttp://research.nesc.ac.uk/node/21