You are here

Graph Colouring Heuristics Guided by Higher Order Graph Properties

TitleGraph Colouring Heuristics Guided by Higher Order Graph Properties
Publication TypeConference Paper
Year of Publication2008
AuthorsJuhos, I\'{a}n, van Hemert, J
Conference NameLecture Notes in Computer Science
Editorvan Hemert, J, Cotta, C
Keywordsevolutionary computation; graph colouring

Graph vertex colouring can be defined in such a way where colour assignments are substituted by vertex contractions. We present various hyper-graph representations for the graph colouring problem all based on the approach where vertices are merged into groups. In this paper, we show this provides a uniform and compact way to define algorithms, both of a complete or a heuristic nature. Moreover, the representation provides information useful to guide algorithms during their search. In this paper we focus on the quality of solutions obtained by graph colouring heuristics that make use of higher order properties derived during the search. An evolutionary algorithm is used to search permutations of possible merge orderings.

Full Text