Centrality based community discovery

MaRDI QIDQ5443212zbMATH OpenFDO

Authors Hemant Balakrishnan, Narsingh Deo

Publication date 20 February 2008

zbMATH Keywords

graph clustering

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Social networks; opinion dynamics (91D30)

Recommendations

• Community identification algorithm using relative edge density measure
• Community discovery algorithms: an overview
• Community structure in social and biological networks
• Enhancing community detection using a network weighting strategy
• Computing Communities in Large Networks Using Random Walks

Cited in

(6)

• Decentralized mining social network communities with agents
• Enhancing community detection using a network weighting strategy
• Community shell's effect on the disintegration of social networks
• Influence of the user importance measure on the group evolution discovery
• Minimal paths between communities induced by geographical networks
• Computing Communities in Large Networks Using Random Walks

This page was built for publication: Centrality based community discovery

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