%0 Conference Paper
%B Springer Lecture Notes on Computer Science
%D 2005
%T Heuristic Colour Assignment Strategies for Merge Models in Graph Colouring
%A Juhos, I.
%A Tóth, A.
%A van Hemert, J. I.
%E G. Raidl
%E J. Gottlieb
%K constraint satisfaction
%K graph colouring
%X In this paper, we combine a powerful representation for graph colouring problems with different heuristic strategies for colour assignment. Our novel strategies employ heuristics that exploit information about the partial colouring in an aim to improve performance. An evolutionary algorithm is used to drive the search. We compare the different strategies to each other on several very hard benchmarks and on generated problem instances, and show where the novel strategies improve the efficiency.
%B Springer Lecture Notes on Computer Science
%I Springer-Verlag, Berlin
%P 132--143
%G eng
%9 inproceedings
%0 Conference Paper
%B Springer Lecture Notes on Computer Science
%D 2004
%T Binary Merge Model Representation of the Graph Colouring Problem
%A Juhos, I.
%A Tóth, A.
%A van Hemert, J. I.
%E J. Gottlieb
%E G. Raidl
%K constraint satisfaction
%K graph colouring
%X This 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.
%B Springer Lecture Notes on Computer Science
%I Springer-Verlag, Berlin
%P 124--134
%@ 3-540-21367-8
%G eng
%9 inproceedings
%0 Conference Paper
%B Kalmàr Workshop on Logic and Computer Science
%D 2003
%T A new permutation model for solving the graph k-coloring problem
%A Juhos, I.
%A Tóth, A.
%A Tezuka, M.
%A Tann, P.
%A van Hemert, J. I.
%K constraint satisfaction
%K graph colouring
%X This paper describes a novel representation and ordering model, that is aided by an evolutionary algorithm, is used in solving the graph k-coloring. A comparison is made between the new representation and an improved version of the traditional graph coloring technique DSATUR on an extensive list of graph k-coloring problem instances with different properties. The results show that our model outperforms the improved DSATUR on most of the problem instances.
%B Kalmàr Workshop on Logic and Computer Science
%P 189--199
%G eng
%9 inproceedings