A general view on computing communities

DOI10.1016/j.mathsocsci.2013.07.002zbMath1296.05189OpenAlexW2000576661MaRDI QIDQ459400

Martin Olsen

Publication date: 8 October 2014

Published in: Mathematical Social Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.mathsocsci.2013.07.002

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Structural and algorithmic properties of 2-community structures, New Insight into 2-Community Structures in Graphs with Applications in Social Networks, Graphs without a partition into two proportionally dense subgraphs, Proportionally dense subgraph of maximum size: complexity and approximation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graph clustering
• Nash stability in additively separable hedonic games and community structures
• Maximizing edge-ratio is NP-complete
• Communities in Large Networks: Identification and Ranking
• Graph Clustering and Minimum Cut Trees
• SOFSEM 2006: Theory and Practice of Computer Science