Maximizing the Cohesion is NP-hard
Abstract
We show that the problem of finding a set with maximum cohesion in an undirected network is NP-hard.
Nous montrons que le problème de trouver un ensemble de cohésion maximum dans un graphe non orienté est NP-dur.
Origin : Files produced by the author(s)
Loading...