%0 Conference Paper
%B Springer Lecture Notes on Computer Science
%D 2006
%T Improving Graph Colouring Algorithms and Heuristics Using a Novel Representation
%A Juhos, I.
%A van Hemert, J. I.
%E J. Gottlieb
%E G. Raidl
%K constraint satisfaction
%K graph colouring
%X We 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.
%B Springer Lecture Notes on Computer Science
%I Springer-Verlag
%P 123--134
%G eng
%9 inproceedings