Exact Polynomial-time Algorithm for the Clique Problem and P = NP for Clique Problem

In this paper, the Minimum Nil Sweeper Algorithm, applicable to Clique problem has been considered. It has been found that the Minimum Nil Sweeper Algorithm is not applicable to Clique problem for all undirected graphs which was previously claimed. A new algorithm has been developed to study the all clique problems for arbitrary undirected graph and its complexity is analysed. An experimental result is cited. Finally, the P = NP has been proved for Clique problem. A theorem related to intersection graph is developed.