Greedy Graph Colouring is a Misleading Heuristic
classification
💻 cs.DS
keywords
colouringgraphgreedyboundmisleadingalgorithmsbranchclique
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.