01191nas a2200181 4500008004100000245008500041210006900126260002000195300001300215520063600228653002800864653002000892100001300912700001600925700001600941700001300957856003900970 2006 eng d00aImproving Graph Colouring Algorithms and Heuristics Using a Novel Representation0 aImproving Graph Colouring Algorithms and Heuristics Using a Nove bSpringer-Verlag a123--1343 aWe introduce a novel representation for the graph colouring problem, called the Integer Merge Model, which aims to reduce the time complexity of an algorithm. Moreover, our model provides useful information for guiding heuristics as well as a compact description for algorithms. To verify the potential of the model, we use it in dsatur, in an evolutionary algorithm, and in the same evolutionary algorithm extended with heuristics. An empiricial investigation is performed to show an increase in efficiency on two problem suites , a set of practical problem instances and a set of hard problem instances from the phase transition.10aconstraint satisfaction10agraph colouring1 aJuhos, I1 aHemert, J I1 aGottlieb, J1 aRaidl, G uhttp://research.nesc.ac.uk/node/11