Maximizing the Cohesion is NP-hard
Networking and Internet Architecture
2011-10-11 v2 Computational Complexity
Abstract
We show that the problem of finding a set with maximum cohesion in an undirected network is NP-hard.
Cite
@article{arxiv.1109.1994,
title = {Maximizing the Cohesion is NP-hard},
author = {Adrien Friggeri and Eric Fleury},
journal= {arXiv preprint arXiv:1109.1994},
year = {2011}
}
Comments
No. RR-7734 (2011)
Related papers
View all related →
Discrete Mathematics · Computer Science
A connected multidimensional maximum bisection problem
Zoran Maksimovic
2015-12-03
Optimization and Control · Mathematics
Resilient Structural Stabilizability of Undirected Networks
Jingqi Li, Ximing Chen, Sérgio Pequito, George J. Pappas +1
2019-06-05
Databases · Computer Science
Reliability Maximization in Uncertain Graphs
Xiangyu Ke, Arijit Khan, Mohammad Al Hasan, Rojin Rezvansangsari
2020-05-26
Discrete Mathematics · Computer Science
Computing the maximum matching width is NP-hard
Kwangjun Ahn, Jisu Jeong
2017-10-17
Networking and Internet Architecture · Computer Science
Joint Data Compression and Caching: Approaching Optimality with Guarantees
Jian Li, Faheem Zafari, Don Towsley, Kin K. Leung +1
2018-01-25
Computational Geometry · Computer Science
Link Crossing Number is NP-hard
Arnaud de Mesmay, Marcus Schaefer, Eric Sedgwick
2019-08-13
Statistical Mechanics · Physics
Network conduciveness with application to the graph-coloring and independent-set optimization transitions
Valmir C. Barbosa
2010-07-12
Data Structures and Algorithms · Computer Science
Node Connectivity Augmentation of Highly Connected Graphs
Waldo Galvez, Dylan Hyatt-Denesik, Afrouz Jabal Ameli, Laura Sanita
2023-11-29
Data Structures and Algorithms · Computer Science
The Complexity of Maximum Matroid-Greedoid Intersection and Weighted Greedoid Maximization
Taneli Mielikäinen, Esko Ukkonen
2007-05-23
Computational Geometry · Computer Science
The Euclidean $k$-Matching Problem is NP-hard
José-Miguel Díaz-Báñez, Ruy Fabila-Monroy, José-Manuel Higes-López, Nestaly Marín +2
2025-10-10
Discrete Mathematics · Computer Science
Co-Clustering Under the Maximum Norm
Laurent Bulteau, Vincent Froese, Sepp Hartung, Rolf Niedermeier
2019-06-17
Geometric Topology · Mathematics
NP-hard problems naturally arising in knot theory
Dale Koenig, Anastasiia Tsvietkova
2024-07-17
Computational Complexity · Computer Science
A More Complicated Hardness Proof for Finding Densest Subgraphs in Bounded Degree Graphs
Manuel Sorge
2013-06-28
Disordered Systems and Neural Networks · Physics
Correlations in weighted networks
M. Angeles Serrano, Marian Boguna, Romualdo Pastor-Satorras
2009-11-11
Combinatorics · Mathematics
An NP-hardness result for the colored constrained maximum 2-edge-colorable subgraph problem in bipartite graphs
Vahan Mkrtchyan
2025-10-15
Artificial Intelligence · Computer Science
Decision-Theoretic Troubleshooting: Hardness of Approximation
Václav Lín
2013-08-02
Computational Complexity · Computer Science
Computing an Evolutionary Ordering is Hard
Laurent Bulteau, Gustavo Sacomoto, Blerina Sinaimeri
2014-10-27
Computational Complexity · Computer Science
Computational Complexity of Queries Based on Itemsets
Nikolaj Tatti
2019-02-05
Data Structures and Algorithms · Computer Science
Maximum Independent Sets in Subcubic Graphs: New Results
Ararat Harutyunyan, Michael Lampis, Vadim Lozin, Jérôme Monnot
2018-10-26
Data Structures and Algorithms · Computer Science
Approximating Multistage Matching Problems
Markus Chimani, Niklas Troost, Tilo Wiedera
2021-05-11
Data Structures and Algorithms · Computer Science
Online Maximum Independent Set of Hyperrectangles
Rishi Advani, Abolfazl Asudeh
2024-10-10
Discrete Mathematics · Computer Science
Weighted Connected Matchings
Guilherme C. M. Gomes, Bruno P. Masquio, Paulo E. D. Pinto, Vinicius F. dos Santos +1
2022-02-11
Data Structures and Algorithms · Computer Science
Computing the k Densest Subgraphs of a Graph
Riccardo Dondi, Danny Hermelin
2021-11-24
Quantum Physics · Physics
Computational aspects of the trace norm contraction coefficient
Idris Delsol, Omar Fawzi, Jan Kochanowski, Akshay Ramachandran
2025-09-23
Data Structures and Algorithms · Computer Science
Orienting Graphs to Optimize Reachability
S. L. Hakimi, E. Schmeichel, Neal E. Young
2015-06-02