A 14h en salle de conférence de l’IXXI.
Abstract :
We show that the problem of finding a set with maximum cohesion in an undirected network is NP-hard.
We show that the problem of finding a set with maximum cohesion in an undirected network is NP-hard.