Distributed Community Detection in Dynamic Graphs

DOI10.1007/978-3-319-03578-9_1zbMath1362.68284arXiv1302.5607OpenAlexW2059665354MaRDI QIDQ2868627

Miriam Di Ianni, Giorgio Gambosi, Emanuele Natale, Riccardo Silvestri, Andrea E. F. Clementi

Publication date: 17 December 2013

Published in: Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1302.5607

zbMATH Keywords

distributed computingdynamic graphssocial opportunistic networks

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85) Distributed algorithms (68W15)

Related Items

Min-max communities in graphs: complexity and computational properties

Cites Work

• Unnamed Item
• Distributed community detection in dynamic graphs
• Complex networks: structure and dynamics
• Flooding time in edge-Markovian dynamic graphs
• The solution of some random NP-hard problems in polynomial expected time
• Community structure in social and biological networks
• Parsimonious flooding in dynamic graphs
• On the Analysis of a Label Propagation Algorithm for Community Detection