A Polynomially Searchable Exponential Neighbourhood for Graph Colouring
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...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
2005-03.
|
| Subjects: | |
| Online Access: | Get fulltext |