A Polynomial Time Solution to the Clique Problem
arXiv:1403.1178
Abstract
The Clique Problem has a reduction to the Maximum Flow Network Interdiction Problem. We review the reduction to evolve a polynomial time algorithm for the Clique Problem. A computer program in C language has been written to validate the easiness of the algorithm.
There is an error while applying the algorithm to the large size problems. This algorithm doesn't provide solution to all Clique problems es, 2 figures