Interval routing schemes allow broadcasting with linear message-complexity (extended abstract)

DOI10.1145/343477.343503zbMath1314.68041OpenAlexW2042434603MaRDI QIDQ5176767

Bernard Mans, Cyril Gavoille, Pierre Fraigniaud

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.343503

zbMATH Keywords

distributed computingcompact routingbroadcastinginterval routing

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Distributed systems (68M14) Network protocols (68M12)

Related Items (1)

Memory Efficient Anonymous Graph Exploration

This page was built for publication: Interval routing schemes allow broadcasting with linear message-complexity (extended abstract)