pith. sign in

arxiv: 1109.1994 · v2 · pith:RIE3LJZZnew · submitted 2011-09-09 · 💻 cs.NI · cs.CC

Maximizing the Cohesion is NP-hard

Adrien Friggeri (ENS / LIP Laboratoire de l'Informatique du Parall\'elisme / INRIA Grenoble Rh\^one-Alpes , IXXI) , Eric Fleury (ENS / LIP Laboratoire de l'Informatique du Parall\'elisme / INRIA Grenoble Rh\^one-Alpes This is my paper
classification 💻 cs.NI cs.CC
keywords cohesionnp-hardfindingmaximizingmaximumnetworkproblemundirected
0
0 comments X
read the original abstract

We show that the problem of finding a set with maximum cohesion in an undirected network is NP-hard.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.