A Polynomial Time Solution to the Clique Problem
  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. 
Pawan Tamta, B.P. Pande, H.S. Dhami
cs.DS math.OC