%0 Journal Article
%T Greedy Graph Colouring is a Misleading Heuristic
%A Ciaran McCreesh
%A Patrick Prosser
%J Computer Science
%D 2013
%I arXiv
%X State of the art maximum clique algorithms use a greedy graph colouring as a bound. We show that greedy graph colouring can be misleading, which has implications for parallel branch and bound.
%U http://arxiv.org/abs/1310.7741v1