2 papers
math.OC2023
Harnessing the mathematics of matrix decomposition to solve planted and maximum clique problem
Salma Omer, Montaz Ali
We consider the problem of identifying a maximum clique in a given graph. We have proposed a mathematical model for this problem. The model resembles the matrix decomposition of th…
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…