@article{JH2006,
	_day = {10},
	abstract = {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.},
	author = {I Juhos and van Hemert, J},
	date-added = {2008-08-18 12:44:11 +0100},
	date-modified = {2009-07-28 16:12:43 +0100},
	editor = {J Gottlieb and G Raidl},
	journal = {Evol Comput in Comb Optim},
	keywords = {constraint satisfaction; graph colouring},
	pages = {123--134},
	pdf = {http://www.vanhemert.co.uk/publications/evocop2006-Improving_Graph_Colouring_Algorithms_and_Heuristics_Using_a_Novel_Representation.pdf},
	publisher = {Springer},
	series = {{LNCS}},
	title = {Improving Graph Colouring Algorithms and Heuristics Using a Novel Representation},
	volume = {3906},
	year = {2006}}