Reduction of Maximum Flow Network Interdiction Problem from The Clique   Problem
  Maximum Flow Network Interdiction Problem (MFNIP) is known to be strongly NP-hard problem. We solve a simple form of MFNIP in polynomial time. We review the reduction of MFNIP from the clique problem. We propose a polynomial time solution to the Clique Problem. 
Pawan Tamta, Bhagwati Prasad Pande, H.S Dhami
cs.DS math.OC