The problem of identifying the densest subgraph of size at least k is NP-hard (Feige et al., 1999).
we define a heuristic for k-partite graphs inspired by a 2-approximation greedy algorithm for arbitrary graphs (Charikar, 2000;Khuller and Saha, 2009).