no code implementations • 25 Mar 2023 • Tommaso Lanciano, Atsushi Miyauchi, Adriano Fazzone, Francesco Bonchi
The Densest Subgraph Problem requires to find, in a given graph, a subset of vertices whose induced subgraph maximizes a measure of density.
