Abstract
The maximum clique problem (MCP) is a famous NP-hard problem, which is difficult for the exact algorithm to solve when the dimension is large. In this......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
