Binary Merge Model Representation of the Graph Colouring Problem (bibtex)

by I Juhos, A Tóth and van Hemert, J

Abstract:

This paper describes a novel representation and ordering model that aided by an evolutionary algorithm, is used in solving the graph \emphk-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.

Reference:

Binary Merge Model Representation of the Graph Colouring Problem (I Juhos, A Tóth and van Hemert, J), In Evol Comput in Comb Optim (J Gottlieb, G Raidl, eds.), Springer, 2004.

Bibtex Entry:

@article{JTH2004, _day = {01}, abstract = {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.}, author = {I Juhos and A T{\'o}th and van Hemert, J}, journal = {Evol Comput in Comb Optim}, date-added = {2008-08-18 12:44:11 +0100}, date-modified = {2008-08-18 12:44:11 +0100}, editor = {J Gottlieb and G Raidl}, isbn = {3-540-21367-8}, keywords = {constraint satisfaction; graph colouring}, number = {3004}, pages = {124--134}, pdf = {http://www.vanhemert.co.uk/publications/evocop2004.Binary_merge_model_representation_of_graph_colouring_problem.pdf}, ps = {http://www.vanhemert.co.uk/publications/evocop2004.Binary_merge_model_representation_of_graph_colouring_problem.ps.gz}, publisher = {Springer}, series = {{LNCS}}, title = {Binary Merge Model Representation of the Graph Colouring Problem}, year = {2004}}

Powered by bibtexbrowser