5 citations · 6 across the 5 of their papers we have counts for
5 papers
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…
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…
Generation, Implementation and Appraisal of an N-gram based Stemming Algorithm
B. P. Pande, Pawan Tamta, H. S. Dhami
A language independent stemmer has always been looked for. Single N-gram tokenization technique works well, however, it often generates stems that start with intermediate character…
Suffix Stripping Problem as an Optimization Problem
B. P. Pande, Pawan Tamta, H. S. Dhami
Stemming or suffix stripping, an important part of the modern Information Retrieval systems, is to find the root word (stem) out of a given cluster of words. Existing algorithms ta…
Cardinality Maximum Flow Network Interdiction Problem Vs. The Clique Problem
Pawan Tamta, Bhagwati Prasad Pande, H. S. Dhami
Cardinality Maximum Flow Network Interdiction Problem (CMFNIP) is known to be strongly NP-hard problem in the literature. A particular case of CMFNIP has been shown to have reducti…