Greedy Graph Colouring is a Misleading Heuristic
Ciaran McCreesh, Patrick Prosser
TL;DR
This paper demonstrates that greedy graph colouring, commonly used as a bound in maximum clique algorithms, can be misleading, affecting the effectiveness of parallel branch and bound methods.
Contribution
It reveals the limitations of greedy graph colouring as a bound in maximum clique algorithms, highlighting potential pitfalls in current heuristic approaches.
Findings
Greedy graph colouring can give misleading bounds.
Implications for parallel branch and bound algorithms.
Challenges assumptions in current maximum clique heuristics.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComplexity and Algorithms in Graphs · Advanced Graph Theory Research · Machine Learning and Algorithms