“…The MEWCP is to find a clique C in G such that the sum of the weights of the edges in C is maximized and the number of vertices in C is no more than m. Like the MVWCP, the decision version of the MEWCP is NP-complete (Ausiello, Crescenzi, Gambosi, Kann, Marchetti-Spaccamela, & Protasi, 1999), as far as it reduces to the maximum clique problem. The MEWCP or its variants are also studied under other names: Maximum diversity (Martí, Gallego, Duarte, & Pardo, 2013;Palubeckis, 2007), maxisum dispersion (Kuby, 1987), MAX-AVG dispersion (Ravi, Rosenkrantz, & Tayi, 1994), remoteclique (Chandra & Halldórsson, 2001), and maximum edge-weighted subgraph (Macambira, 2003).…”