“…Thereby, the problem of protein complex prediction is cast to partition graph G, C = {C 1 , C 2 , …, C k }, such that each C i is a biclique spanned subgraph (Angeleska & Nikoloski, 2019) by removing a minimum number of edges. It has been shown that the problem of nding an optimal coherent network partition is NP-hard (Angeleska & Nikoloski, 2019), while a graph transformation has also been proposed to obtain a O(logn)approximation algorithm on a bipartite graph (Angeleska, et al, 2021). Thus, greedy approximation algorithms, including PC2P, GCC-v, and CUBCO, have been proposed for solving this optimization problem.…”