A polynomially searchable exponential neighbourhood for graph colouring.

Celia A. Glass, Adam Prügel-Bennett

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 permuta...
BibTeX
@inproceedings{glass2005polynomially,
  author = {Celia A. Glass and Adam Prügel-Bennett},
  title = {{A polynomially searchable exponential neighbourhood for graph colouring.}},
  booktitle = {JORS},
  year = {2005},
  url = {https://openreview.net/forum?id=AZ4nAcLE9Ek},
}

Loading related content...

Figure