Journal of Computer Science and Technology

, Volume 16, Issue 4, pp 388–391

Hardness and methods to solve CLIQUE

Notes

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
  • 44 Downloads

Abstract

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.

Keywords

algorithmNP-hardnessapproximation ratiodynamic programmingcomplexity

Copyright information

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

Authors and Affiliations

  1. 1.Department of Computer ScienceShandong UniversityJinanP.R. China