2 papers
math.OC2022
Rank-sparsity decomposition for planted quasi clique recovery
Sakirudeen A. Abdulsalaam, Montaz Ali
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 sp…
math.OC2021
Convex Formulation for Planted Quasi-Clique Recovery
Sakirudeen A. Abdulsalaam, M. Montaz Ali
In this paper, we consider the planted quasi-clique or γ-clique problem. This problem is an extension of the well known planted clique problem which is NP-hard. The maximum quasi-c…