A survey on the densest subgraph problem and its variants

T Lanciano, A Miyauchi, A Fazzone, F Bonchi - ACM Computing Surveys, 2024 - dl.acm.org
The Densest Subgraph Problem requires us to find, in a given graph, a subset of vertices
whose induced subgraph maximizes a measure of density. The problem has received a …