%0 Journal Article
	%A Zohreh O. Akbari
	%D 2008
	%J International Journal of Computer and Information Engineering
	%B World Academy of Science, Engineering and Technology
	%I Open Science Index 21, 2008
	%T A Deterministic Polynomial-time Algorithm for the Clique Problem and the Equality of P and NP Complexity Classes
	%U https://publications.waset.org/pdf/13828
	%V 21
	%X In this paper a deterministic polynomial-time
algorithm is presented for the Clique problem. The case is considered
as the problem of omitting the minimum number of vertices from the
input graph so that none of the zeroes on the graph-s adjacency
matrix (except the main diagonal entries) would remain on the
adjacency matrix of the resulting subgraph. The existence of a
deterministic polynomial-time algorithm for the Clique problem, as
an NP-complete problem will prove the equality of P and NP
complexity classes.
	%P 3013 - 3018