A combinatorial model and algorithm for globally searching community structure in complex networks

DOI10.1007/s10878-010-9356-0zbMath1245.90013OpenAlexW2065555371MaRDI QIDQ437056

Rui-Sheng Wang, Xiang-Sun Zhang, Yong Wang, Zhen-Ping Li

Publication date: 17 July 2012

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-010-9356-0

zbMATH Keywords

NP-hardheuristic algorithmcomplex networkcommunity structurelinear integer programming

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Related Items (4)

A technique for the concept-based detection of functional modules in an interaction network ⋮ Searching Graph Communities by Modularity Maximization via Convex Optimization ⋮ Social Network Optimization for Cluster Ensemble Selection ⋮ THE MAXIMUM COMMUNITY PARTITION PROBLEM IN NETWORKS

Cites Work

• Modularity-maximizing graph communities via mathematical programming
• Some APX-completeness results for cubic graphs
• Statistical mechanics of complex networks
• A simple min-cut algorithm
• Community structure in social and biological networks
• SOFSEM 2006: Theory and Practice of Computer Science

This page was built for publication: A combinatorial model and algorithm for globally searching community structure in complex networks