3 citations · 3 across the 4 of their papers we have counts for
1 paper · 1 filter
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…