2 papers
cs.DS2019
On the tractability of the maximum clique problem
R. Dharmarajan, D. Ramachandran
The maximum clique problem is a classical NP-complete problem in graph theory and has important applications in many domains. In this paper we show, in a partially non-constructive…
math.CO2019
A modified greedy algorithm to improve bounds for the vertex cover number
R. Dharmarajan, D. Ramachandran
In any attempt at designing an efficient algorithm for the minimum vertex cover problem, obtaining good upper and lower bounds for the vertex cover number could be crucial. In this…