A Polynomial Time Solution to the Clique Problem
Pawan Tamta, Bhagwati Prasad Pande, Hoshiyar S. Dhami · arXiv (Cornell University) · 2014
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.