A note on exact distance labeling

DOI10.1016/j.ipl.2011.04.006zbMath1260.05054OpenAlexW2074619214MaRDI QIDQ1944109

David Peleg, Oren Weimann

Publication date: 4 April 2013

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2011.04.006

zbMATH Keywords

distributed systemsshortest pathsgraph algorithmslabeling schemes

Mathematics Subject Classification ID

Distance in graphs (05C12) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

Better distance labeling for unweighted planar graphs ⋮ Implicit representation of relations ⋮ Better distance labeling for unweighted planar graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Proof of the squashed cube conjecture
• Traveling with a Pez Dispenser (or, Routing Issues in MPLS)
• Distance labeling in graphs
• Proximity-preserving labeling schemes
• Object location using path separators

This page was built for publication: A note on exact distance labeling