Notes

Journal of Computer Science and Technology

, Volume 16, Issue 4, pp 388-391

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 Access

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

algorithm NP-hardness approximation ratio dynamic programming complexity