贪婪图着色是一种误导性的启发式算法
Greedy Graph Colouring is a Misleading Heuristic
摘要:
现有技术的最大团算法使用贪婪图着色作为界限。我们表明,贪婪图着色可能是误导,这对并行分支和界限的影响。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。