A parallel computing hierarchical community approach based on weighted-graph

DOI10.3724/SP.J.1001.2012.04076MaRDI QIDQ4901405zbMATH OpenWikidataFDO

Authors Wangqun Lin, Fengshun Lu, Zhaoyun Ding, Quanyuan Wu, Bin Zhou, Yan Jia

Publication date 24 January 2013

Published in Journal of Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3724/SP.J.1001.2012.04076

zbMATH Keywords

community discoveryhierarchical treeparallel computingsocial networkweighted-graph

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Graph theory (including graph drawing) in computer science (68R10) Social networks; opinion dynamics (91D30)

Recommendations

• scientific article; zbMATH DE number 7109096
• Parallel label propagation algorithm based on weight and random walk
• A community detection algorithm based on graph compression for large-scale social networks
• Community discovery in weighted social networks based on similarities of common neighbors
• Parallel community detection for massive graphs

Cited in

(1)

• Community discovery in weighted social networks based on similarities of common neighbors

This page was built for publication: A parallel computing hierarchical community approach based on weighted-graph

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