Return to results
Journal articles (2019), European Journal of Operational Research, 277 (1), pp. 112-127

The Maximum Clique Interdiction Problem

FURINI F., LJUBIC Ivana , MARTIN S., SAN SEGUNDO P.

Given a graph G and an interdiction budget k , the Maximum Clique Interdiction Problem asks to find a sub- set of at most k vertices to remove from G so that the size of the maximum clique in the remaining graph is minimized. This problem has applications

FURINI, F., LJUBIC, I., MARTIN, S. and SAN SEGUNDO, P. (2019). The Maximum Clique Interdiction Problem. European Journal of Operational Research, 277(1), pp. 112-127.