全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

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

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133