2013•International Journal of Computer ApplicationsOpen access

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

Kanak ChandraBora, Bichitra Kalita

Abstract

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.

Open-access reader

About this research paper

What this paper is about

Why it matters

OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Clique, Clique problem, Computer science, Time complexity, NP-complete, P versus NP problem, Algorithm, Theoretical computer science