Sciweavers

Share
EVOW
2005
Springer

Heuristic Colour Assignment Strategies for Merge Models in Graph Colouring

10 years 8 months ago
Heuristic Colour Assignment Strategies for Merge Models in Graph Colouring
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.
István Juhos, Attila Tóth, Jano I. v
Added 29 Jun 2010
Updated 29 Jun 2010
Type Conference
Year 2005
Where EVOW
Authors István Juhos, Attila Tóth, Jano I. van Hemert
Comments (0)
books