-
31浏览
-
0点赞
-
0收藏
-
0分享
-
43下载
-
0评论
-
引用
期刊论文
Hardness and Methods to Solve CLIQUE
Vol. 16 No.4 J. Comput. Sci. & Technol. July 2001,-0001,():
The paper briefly reviews NP-hard optimizationproblems and their inapproximability. The hardness of solving CLIQUE problem is specifically dis-cussed. A dynamic-programming algorithm and its improved version for CLIQUE are reviewed and some additional analysis is presented. The analysis implies that the improved algorithm, HEWN (hierarchical edge-weighted network), only provides a heuristic or usful method, but cannot be called a polynomial algorithm
【免责声明】以下全部内容由[朱大铭]上传于[2006年12月01日 02时11分01秒],版权归原创者所有。本文仅代表作者本人观点,与本网站无关。本网站对文中陈述、观点判断保持中立,不对所包含内容的准确性、可靠性或完整性提供任何明示或暗示的保证。请读者仅作参考,并请自行承担全部责任。
本学者其他成果
同领域成果