Journal of Computer Science and Technology

, Volume 16, Issue 4, pp 388–391

Hardness and methods to solve CLIQUE


    • Department of Computer ScienceShandong University
  • Luan Junfeng 
    • Department of Computer ScienceShandong University
  • Ma Shaohan 
    • Department of Computer ScienceShandong University

DOI: 10.1007/BF02948987

Cite this article as:
Zhu, D., Luan, J. & Ma, S. J. Comput. Sci. & Technol. (2001) 16: 388. doi:10.1007/BF02948987


The paper briefly reviews NP-hard optimization problems and their inapproximability. The hardness of solving CLIQUE problem is specifically discussed. 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 useful method, but cannot be called a polynomial algorithm.


algorithmNP-hardnessapproximation ratiodynamic programmingcomplexity
Download to read the full article text

Copyright information

© Science Press, Beijing China and Allerton Press Inc. 2001