All Title Author
Keywords Abstract


Greedy Graph Colouring is a Misleading Heuristic

Full-Text   Cite this paper   Add to My Lib

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.

Full-Text

comments powered by Disqus

Contact Us

service@oalib.com

QQ:3279437679

微信:OALib Journal