Average Whenever You Meet: Opportunistic Protocols for Community Detection

Becchetti, Luca; Clementi, Andrea; Manurangsi, Pasin; Natale, Emanuele; Pasquale, Francesco; Raghavendra, Prasad; Trevisan, Luca

doi:10.4230/LIPIcs.ESA.2018.7

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

Average Whenever You Meet: Opportunistic Protocols for Community Detection

MPS-Authors

/persons/resource/persons202523

Natale, Emanuele
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

http://drops.dagstuhl.de/opus/volltexte/2018/9470/
(Publisher version)

http://drops.dagstuhl.de/doku/urheberrecht1.html
(Publisher version)

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Becchetti, L., Clementi, A., Manurangsi, P., Natale, E., Pasquale, F., Raghavendra, P., et al. (2018). Average Whenever You Meet: Opportunistic Protocols for Community Detection. In Y. Azar, H. Bast, & G. Herman (Eds.), 26th Annual European Symposium on Algorithms (pp. 1-13). Wadern: Schloss Dagstuhl. doi:10.4230/LIPIcs.ESA.2018.7.

Cite as: https://hdl.handle.net/21.11116/0000-0002-A957-E

Abstract

There is no abstract available