Brief Announcement

DOI10.1145/2933057.2933066zbMath1375.68202arXiv1602.04095OpenAlexW2484370474MaRDI QIDQ5361942

Ioan Todinca, Pedro Montealegre

Publication date: 29 September 2017

Published in: Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

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

zbMATH Keywords

graph connectivityspanning forestdeterministic protocolbroadcast congested clique

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Distributed systems (68M14) Network protocols (68M12) Distributed algorithms (68W15)

Related Items (3)

On Distance-d Independent Set and Other Problems in Graphs with “few” Minimal Separators ⋮ Graph reconstruction in the congested clique ⋮ The role of randomness in the broadcast congested clique model

This page was built for publication: Brief Announcement