A note on exact distance labeling

Authors:
Oren Weimann;David Peleg
Affiliations:
The Weizmann Institute of Science, Israel;The Weizmann Institute of Science, Israel
Venue:
Information Processing Letters
Year:
2011

Citing 5
Cited 0

Approximate Distance Labeling Schemes

ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Distance labeling in graphs

Journal of Algorithms
Traveling with a Pez Dispenser (or, Routing Issues in MPLS)

SIAM Journal on Computing
Object location using path separators

Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Proximity-preserving labeling schemes

Journal of Graph Theory

Quantified Score

Hi-index	0.89

Visualization

Abstract

We show that the vertices of an edge-weighted undirected graph can be labeled with labels of size O(n) such that the exact distance between any two vertices can be inferred from their labels alone in O(log^@?n) time. This improves the previous best exact distance labeling scheme that also requires O(n)-sized labels but O(loglogn) time to compute the distance. Our scheme is almost optimal as exact distance labeling is known to require labels of length @W(n).