Exact Distance Labelings Yield Additive-Stretch Compact Routing Schemes

DOI10.1007/11864219_24MaRDI QIDQ3524317zbMATH OpenOpenAlexFDO

Authors Arthur Brady, Lenore J. Cowen

Publication date 9 September 2008

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11864219_24

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Network design and communication in computer systems (68M10)

Recommendations

• A note on exact distance labeling
• Simpler, faster and shorter labels for distances in graphs
• On approximate distance labels and routing schemes with affine stretch
• Distance and routing labeling schemes for non-positively curved plane graphs
• Optimal distance labeling for interval and circular-arc graphs

Cited in

(4)

• On compact and efficient routing in certain graph classes
• On approximate distance labels and routing schemes with affine stretch
• Algorithms and Computation
• Compact and Low Delay Routing Labeling Scheme for Unit Disk Graphs

This page was built for publication: Exact Distance Labelings Yield Additive-Stretch Compact Routing Schemes

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