| HAL-Inria | Publications, software ... of Inria's scientists |
Reports
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.
Cited literature [2 references]
https://hal.inria.fr/inria-00621065
Contributor : Adrien Friggeri Connect in order to contact the contributor
Submitted on : Sunday, October 9, 2011 - 2:25:52 AM
Last modification on : Friday, October 22, 2021 - 4:27:31 AM
Long-term archiving on: : Tuesday, January 10, 2012 - 2:20:17 AM
Contributor : Adrien Friggeri Connect in order to contact the contributor
Submitted on : Sunday, October 9, 2011 - 2:25:52 AM
Last modification on : Friday, October 22, 2021 - 4:27:31 AM
Long-term archiving on: : Tuesday, January 10, 2012 - 2:20:17 AM
Files
RR-7734.pdf
Files produced by the author(s)