
On the tractability of the maximum independent set problem
The maximum independent set problem is a classical NPcomplete problem i...
read it

A modified greedy algorithm to improve bounds for the vertex cover number
In any attempt at designing an efficient algorithm for the minimum verte...
read it
R. Dharmarajan
is this you? claim profile