Improved compact routing schemes for dynamic trees

DOI10.1145/1400751.1400777MaRDI QIDQ2934343zbMATH OpenOpenAlexFDO

Authors Amos Korman

Publication date 12 December 2014

Published in Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing (Search for Journal in Brave)

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

zbMATH Keywords

distributed algorithmsdynamic treesrouting schemes

Mathematics Subject Classification ID

Trees (05C05) Network protocols (68M12) Distributed systems (68M14) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Recommendations

• Distributed Computing
• scientific article; zbMATH DE number 2086375
• General compact labeling schemes for dynamic trees
• Compact Separator Decompositions in Dynamic Trees and Applications to Labeling Schemes
• Labeling schemes for dynamic tree networks

Cited in

(6)

• Compact routing messages in self-healing trees
• Dynamic Routing Schemes for General Graphs
• Prefix routing schemes in dynamic networks
• Compact Routing In Chordal Grids And Other Networks
• New bounds for the controller problem
• Compact routing schemes for dynamic ring networks

This page was built for publication: Improved compact routing schemes for dynamic trees

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