2014/02/10 by Pawan Tamta, Tamta, Pawan, Bhagwati Prasad Pande +3
Computer Science · #Complexity and Algorithms in Graphs #Advanced Graph Theory Research #Software-Defined Networks and 5G
paper · pdf · doi:10.48550/arxiv.1402.2022
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.