Greedy Graph Colouring is a Misleading Heuristic
arXiv:1310.7741
Abstract
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.