Year: 2013
Type: preprint
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.
Source: arXiv (Cornell University)
Authors: McCreesh, Ciaran, Prosser, Patrick
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W1506917474