On maximum degree‐based

γ

‐quasi‐clique problem: Complexity and exact approaches

Publisher： John Wiley & Sons Inc

E-ISSN： 1097-0037|71|2|136-152

ISSN： 0028-3045

Source： NETWORKS: AN INTERNATIONAL JOURNAL, Vol.71, Iss.2, 2018-03, pp. : 136-152

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

We consider the problem of finding a degree‐based $γ$ ‐quasi‐clique of maximum cardinality in a given graph for some fixed $γ \in (0, 1]$ . A degree‐based $γ$ ‐quasi‐clique (often referred to as simply a quasi‐clique) is a subgraph, where the degree of each vertex is at least $γ$ times the maximum possible degree of a vertex in the subgraph. A degree‐based $γ$ ‐quasi‐clique is a relative clique relaxation model, where the case of $γ = 1$ corresponds to the well‐known concept of a clique. In this article, we first prove that the problem is $N P$ ‐hard for any fixed $γ \in (0, 1]$ , which addresses one of the open questions in the literature. More importantly, we also develop new exact solution methods for solving the problem and demonstrate their advantages and limitations in extensive computational experiments with both random and real‐world networks. Finally, we outline promising directions of future research including possible functional generalizations of the considered clique relaxation model. © 2017 Wiley Periodicals, Inc. NETWORKS, Vol. 71(2), 136–152 2018