4 citations · 8 across the 3 of their papers we have counts for
1 paper · 1 filter
Ricardo C. Corrêa, Philippe Michelon, Bertrand Le Cun +2
Finding the clique of maximum cardinality in an arbitrary graph is an NP-Hard problem that has many applications, which has motivated studies to solve it exactly despite its diffic…