Distance Labels with Optimal Local Stretch

DOI10.1007/978-3-662-43948-7_5MaRDI QIDQ5167730zbMATH OpenOpenAlexFDO

Authors Ittai Abraham, Shiri Chechik

Publication date 1 July 2014

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

Full work available at URL https://doi.org/10.1007/978-3-662-43948-7_5

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Distance in graphs (05C12)

Recommendations

• Approximate distance labeling schemes
• scientific article; zbMATH DE number 1875437
• Pair Labellings with Given Distance
• Distance labeling scheme and split decomposition
• On approximate distance labels and routing schemes with affine stretch
• A note on exact distance labeling
• Sublinear Distance Labeling
• Distance labeling in graphs
• Proximity-preserving labeling schemes
• Distance labellings of graphs

Cited in

(2)

• On approximate distance labels and routing schemes with affine stretch
• Deterministic incremental APSP with polylogarithmic update time and stretch

This page was built for publication: Distance Labels with Optimal Local Stretch

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