|NeSC Bibliographic Database|
A new permutation model for solving the graph k-coloring problem
Juhos,I. Tóth,A. Tezuka,M. Tann,P. van Hemert,J.I. ,
Appeared in: Kalmàr Workshop on Logic and Computer Science,
Field of Science: e-Science
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.
Keywords: constraint satisfaction, graph colouring,
|Last Updated: 22 Jun 12 11:02|