Maximizing the Cohesion is NP-hard
arXiv:1109.1994
Abstract
We show that the problem of finding a set with maximum cohesion in an undirected network is NP-hard.
No. RR-7734 (2011)
arXiv:1109.1994
We show that the problem of finding a set with maximum cohesion in an undirected network is NP-hard.
No. RR-7734 (2011)