TY  - CONF
T1  - Improving Graph Colouring Algorithms and Heuristics Using a Novel Representation
T2  - Springer Lecture Notes on Computer Science
Y1  - 2006
A1  - Juhos, I.
A1  - van Hemert, J. I.
ED  - J. Gottlieb
ED  - G. Raidl
KW  - constraint satisfaction
KW  - graph colouring
AB  - 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.
JF  - Springer Lecture Notes on Computer Science
PB  - Springer-Verlag
ER  -