LeaDCD: leadership concept-based method for community detection in social networks

DOI10.1016/j.ins.2024.121341zbMATH Open1548.91073MaRDI QIDQ6608320

Elyazid Akachar, Bouchra Frikh, Yahya Bougteb, Brahim Ouhbi

Publication date: 19 September 2024

Published in: Information Sciences (Search for Journal in Brave)

zbMATH Keywords

graph theorysocial networkscommunity detectionleadersinfluential nodesdegree centrality measure

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Applications of graph theory (05C90)

Cites Work

• A novel mixed integer linear programming model for clustering relational networks
• Embedding-based silhouette community detection
• Community structure in social and biological networks
• Fast unfolding of communities in large networks
• Algorithm 457: finding all cliques of an undirected graph
• Information diffusion-aware likelihood maximization optimization for community detection

This page was built for publication: LeaDCD: leadership concept-based method for community detection in social networks

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