Find your place: simple distributed algorithms for community detection
From MaRDI portal
Publication:4575798
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
Cited in
(8)- Step-by-step community detection in volume-regular graphs
- Eigenvector Computation and Community Detection in Asynchronous Gossip Models
- Threshold-based network structural dynamics
- Threshold-based network structural dynamics
- Find Your Place: Simple Distributed Algorithms for Community Detection
- Distributed community detection in dynamic graphs
- Average whenever you meet: opportunistic protocols 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)