Find out how to access previewonly content
Journal of Computer Science and Technology
, Volume 16, Issue 4, pp 388391
First online:
Hardness and methods to solve CLIQUE
 Zhu Daming Affiliated withDepartment of Computer Science, Shandong University Email author
 , Luan Junfeng Affiliated withDepartment of Computer Science, Shandong University
 , Ma Shaohan Affiliated withDepartment of Computer Science, Shandong University
Rent the article at a discount
Rent now* Final gross prices may vary according to local VAT.
Get AccessAbstract
The paper briefly reviews NPhard optimization problems and their inapproximability. The hardness of solving CLIQUE problem is specifically discussed. A dynamicprogramming algorithm and its improved version for CLIQUE are reviewed and some additional analysis is presented. The analysis implies that the improved algorithm, HEWN (hierarchical edgeweighted network), only provides a heuristic or useful method, but cannot be called a polynomial algorithm.
Keywords
algorithm NPhardness approximation ratio dynamic programming complexity Title
 Hardness and methods to solve CLIQUE
 Journal

Journal of Computer Science and Technology
Volume 16, Issue 4 , pp 388391
 Cover Date
 200107
 DOI
 10.1007/BF02948987
 Print ISSN
 10009000
 Online ISSN
 18604749
 Publisher
 Science Press
 Additional Links
 Topics
 Keywords

 algorithm
 NPhardness
 approximation ratio
 dynamic programming
 complexity
 Industry Sectors
 Authors

 Daming Zhu ^{(1)}
 Junfeng Luan ^{(1)}
 Shaohan Ma ^{(1)}
 Author Affiliations

 1. Department of Computer Science, Shandong University, 250100, Jinan, P.R. China