Detecting community structure via the maximal sub-graphs and belonging degrees in complex networks

DOI10.1016/j.physa.2014.08.050zbMath1402.91619OpenAlexW1975649342MaRDI QIDQ1783223

Yaozu Cui, Justine Eustace, Xing-Yuan Wang

Publication date: 20 September 2018

Published in: Physica A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.physa.2014.08.050

zbMATH Keywords

complex networkscommunity structuremaximal sub-graphbelonging degree

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82)

Related Items (1)

Moderate tolerance promotes tag-mediated cooperation in spatial prisoner's dilemma game

Uses Software

• Algorithm 457

Cites Work

• Unnamed Item
• Unnamed Item
• Community detection by modularity maximization using GRASP with path relinking
• Structure in complex networks
• Scale-Free Networks
• Partitioning Sparse Matrices with Eigenvectors of Graphs
• An Efficient Heuristic Procedure for Partitioning Graphs
• Community structure in social and biological networks
• Fast unfolding of communities in large networks
• Finding communities in weighted networks through synchronization
• Algorithm 457: finding all cliques of an undirected graph

This page was built for publication: Detecting community structure via the maximal sub-graphs and belonging degrees in complex networks