Dynamic Routing Schemes for General Graphs

DOI10.1007/11786986_54MaRDI QIDQ3613795zbMATH OpenOpenAlexFDO

Authors Amos Korman, David Peleg

Publication date 12 March 2009

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11786986_54

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Dynamic routing schemes for graphs with low local density
• Improved compact routing schemes for dynamic trees
• scientific article; zbMATH DE number 2038724
• Compact routing schemes for dynamic ring networks
• scientific article; zbMATH DE number 2086375

Cited in

(13)

• Algorithms for generalized round robin routing
• The general routing polyhedron: A unifying framework
• Compact separator decompositions in dynamic trees and applications to labeling schemes
• Dynamic Routing and Location Services in Metrics of Low Doubling Dimension
• Control of Some Graph Invariants in Dynamic Routing
• scientific article; zbMATH DE number 4058842 (Why is no real title available?)
• scientific article; zbMATH DE number 4059093 (Why is no real title available?)
• Greedy Dynamic Routing on Arrays
• Directional Routing via Generalized st-Numberings
• Bubbles: Adaptive Routing Scheme for High-Speed Dynamic Networks
• Dynamic routing schemes for graphs with low local density
• New results in graph routing
• Compact routing schemes for dynamic ring networks

This page was built for publication: Dynamic Routing Schemes for General Graphs

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