Main menu
You are here
Historical Interest Only
This is a static HTML version of an old Drupal site. The site is no longer maintained and could be deleted at any point. It is only here for historical interest.
Binary Merge Model Representation of the Graph Colouring Problem
23 August 2007 - 1:54pm — Jano.van.Hemert
| Title | Binary Merge Model Representation of the Graph Colouring Problem |
| Publication Type | Conference Paper |
| Year of Publication | 2004 |
| Authors | Juhos, I, Tóth, A, van Hemert, JI |
| Conference Name | Springer Lecture Notes on Computer Science |
| Publisher | Springer-Verlag, Berlin |
| Editor | Gottlieb, J, Raidl, G |
| ISBN Number | 3-540-21367-8 |
| Keywords | constraint satisfaction; graph colouring |
| 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. |
| Full Text |
