On the complexity of Newman's community finding approach for biological and social networks

DOI10.1016/J.JCSS.2012.04.003zbMath1258.05118OpenAlexW2137172591MaRDI QIDQ1936247

Devendra Desai, Bhaskar Das Gupta

Publication date: 21 February 2013

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2012.04.003

zbMATH Keywords

social networksapproximation algorithmscommunity detectionbiological networksapproximation hardnessmodularity clustering

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Applications of graph theory (05C90) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Approximation algorithms (68W25) Systems biology, networks (92C42)

Related Items (9)

Why did the shape of your network change? (On detecting network anomalies via non-local curvatures) ⋮ Mixing local and global information for community detection in large networks ⋮ Unnamed Item ⋮ On a connection between small set expansions and modularity clustering ⋮ Additive approximation algorithms for modularity maximization ⋮ A near-optimal adaptive algorithm for maximizing modularity in dynamic scale-free networks ⋮ A review of two network curvature measures ⋮ Toward Optimal Community Detection: From Trees to General Weighted Networks ⋮ The parameterised complexity of computing the maximum modularity of a graph

This page was built for publication: On the complexity of Newman's community finding approach for biological and social networks