1 paper
Tommaso Lanciano, Atsushi Miyauchi, Adriano Fazzone +1
The Densest Subgraph Problem requires to find, in a given graph, a subset of vertices whose induced subgraph maximizes a measure of density. The problem has received a great deal o…