Find your place: simple distributed algorithms for community detection
DOI10.1137/1.9781611974782.59zbMATH Open1410.68278OpenAlexW2163991510MaRDI QIDQ4575798FDOQ4575798
Authors: Luca Becchetti, Francesco Pasquale, Luca Trevisan, Andrea Clementi, Emanuele Natale 
Publication date: 16 July 2018
Published in: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1.9781611974782.59
Recommendations
- Find Your Place: Simple Distributed Algorithms for Community Detection
- Distributed Community Detection in Dynamic Graphs
- Distributed community detection in dynamic graphs
- Average whenever you meet: opportunistic protocols for community detection
- On the Analysis of a Label Propagation Algorithm for Community Detection
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)
Cited In (8)
- Average whenever you meet: opportunistic protocols for community detection
- Threshold-based network structural dynamics
- Threshold-based network structural dynamics
- Step-by-step community detection in volume-regular graphs
- Eigenvector Computation and Community Detection in Asynchronous Gossip Models
- Distributed community detection in dynamic graphs
- Find Your Place: Simple Distributed Algorithms for Community Detection
- Data collection in population protocols with non-uniformly random scheduler
This page was built for publication: Find your place: simple distributed algorithms for community detection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4575798)
