most citedOptimum Partition Parameter of Divide-and-Conquer Algorithm for Solving Closest-Pair Problem

7 citations · 7 across the 1 of their papers we have counts for

collaborators

1 paper

cs.CG2011★ 7 cited

Optimum Partition Parameter of Divide-and-Conquer Algorithm for Solving Closest-Pair Problem

Mohammad Zaidul Karim, Nargis Akter

Divide and Conquer is a well known algorithmic procedure for solving many kinds of problem. In this procedure, the problem is partitioned into two parts until the problem is trivia…