Abdulsalaam, Sakirudeen A.; Ali, Montaz - In: Journal of Global Optimization 93 (2025) 4, pp. 1121-1144
In this paper, we apply the Rank-Sparsity Matrix Decomposition to the planted Maximum Quasi-Clique Problem (MQCP). This problem has the planted Maximum Clique Problem (MCP) as a special case. The maximum clique problem is NP-hard. A Quasi-clique or γ-clique is a dense graph with the edge...