2 citations · 3 across the 7 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2014★ 1 cited
A Polynomial Time Solution to the Clique Problem
Pawan Tamta, B. P. Pande, H. S. Dhami
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 compute…
cs.DS2014
Reduction of Maximum Flow Network Interdiction Problem from The Clique Problem
Pawan Tamta, Bhagwati Prasad Pande, H. S Dhami
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…