Solving the Multiobjective Quasi-Clique Problem

Daniela Scherer dos Santos, Kathrin Klamroth, Pedro Martins +1

Given a simple undirected graph $G$, a quasi-clique is a subgraph of $G$ whose density is at least ${\hat{I}}^3$ $(0<{\hat{I}}^3\le 1)$. Finding a maximum quasi-clique has been addressed from two…