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.
A new permutation model for solving the graph k-coloring problem
23 August 2007 - 1:54pm — Jano.van.Hemert
| Title | A new permutation model for solving the graph k-coloring problem |
| Publication Type | Conference Paper |
| Year of Publication | 2003 |
| Authors | Juhos, I, Tóth, A, Tezuka, M, Tann, P, van Hemert, JI |
| Conference Name | Kalmàr Workshop on Logic and Computer Science |
| Keywords | constraint satisfaction; graph colouring |
| Abstract | 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. |
| Full Text |
