A Polynomially Searchable Exponential Neighbourhood for Graph Colouring


Glass, Celia A. and Prügel-Bennett, Adam (2005) A Polynomially Searchable Exponential Neighbourhood for Graph Colouring. Journal of the Operational Research Society, 56, (3), 324-330.

Download

[img] Postscript
Download (217Kb)

Description/Abstract

In this paper we develop a new graph colouring strategy. Our heuristic is an example of a so called "polynomially searchable exponential neighbourhood" approach. The neighbourhood is that of permutations of the colours of vertices of a subgraph. Our approach provides a solution method for colouring problems with edge weights. Results for initial tests on unweighted K-colouring benchmark problems are presented. Our colour permutation move was found in practice to be too slow to justify its use on these problems. By contrast, our implementation of iterative descent, which incorporates a permutation kickback move, performed extremely well. Moreover, our approach may yet prove valuable for weighted K-colouring. In addition, our approach offers an improved measure of the distance between colourings of a graph. Key words: Graph colouring, Optimisation, Heuristics, Local search, Exponential neighbourhood.

Item Type: Article
Divisions: Faculty of Physical Sciences and Engineering > Electronics and Computer Science > Comms, Signal Processing & Control
ePrint ID: 256036
Date Deposited: 26 Sep 2001
Last Modified: 27 Mar 2014 19:58
Further Information:Google Scholar
ISI Citation Count:8
URI: http://eprints.soton.ac.uk/id/eprint/256036

Actions (login required)

View Item View Item