A density set algorithm for searching communities in complex networks

MaRDI QIDQ2916705zbMATHFDO

Authors Dawei Zhang, Dan Huang, Fuding Xie, Yong Zhang, Yan Sun

Publication date 5 October 2012

Published in Journal of University of Electronic Science and Technology of China (Search for Journal in Brave)

zbMATH Keywords

complex networkcommunitydensity set

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30)

Recommendations

• Detecting network communities: a new systematic and efficient algorithm
• Finding network communities using modularity density
• Finding community structure in networks using a shortest-path-based \(k\)-means algorithm
• Formalising and detecting community structures in real world complex networks
• An algorithm J-SC of detecting communities in complex networks

Cited in

(5)

• Mining hierarchical community structure within networks from density-connected traveling orders
• Traversing a graph for identifying communities
• scientific article; zbMATH DE number 6907813 (Why is no real title available?)
• A DC Programming Approach for Finding Communities in Networks
• The k-Dense Method to Extract Communities from Complex Networks

This page was built for publication: A density set algorithm for searching communities in complex networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2916705)