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

DOI10.1145/343477.343503MaRDI QIDQ5176767zbMATH OpenOpenAlexFDO

Authors Pierre Fraigniaud, Cyril Gavoille, Bernard Mans

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

broadcastingcompact routingdistributed computinginterval routing

Mathematics Subject Classification ID

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

Recommendations

• Interval routing schemes allow broadcasting with linear message-complexity
• Interval Routing
• Interval routing schemes
• Interval routing schemes
• The complexity of interval routing on random graphs

Cited in

(2)

• Interval routing schemes allow broadcasting with linear message-complexity
• Memory Efficient Anonymous Graph Exploration

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5176767)