Assigning labels in unknown anonymous networks (extended abstract)

DOI10.1145/343477.343527zbMath1314.68374OpenAlexW1966788533MaRDI QIDQ5176776

Stéphane Pérennes, Pierre Fraigniaud, Andrzej Pelc, David Peleg

Publication date: 3 March 2015

Published in: Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/343477.343527

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Communication networks in operations research (90B18) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Graph algorithms (graph-theoretic aspects) (05C85) Distributed systems (68M14) Distributed algorithms (68W15) Online algorithms; streaming algorithms (68W27)

Related Items (2)

Brief Announcement: Efficient Computation in Congested Anonymous Dynamic Networks ⋮ Efficient communication in unknown networks

This page was built for publication: Assigning labels in unknown anonymous networks (extended abstract)