A note on exact distance labeling

Oren Weimann; David Peleg

doi:10.1016/j.ipl.2011.04.006

A note on exact distance labeling

Oren Weimann, David Peleg

Weizmann Institute of Science

Research output: Contribution to journal › Article › peer-review

12 Scopus citations

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 Ω(n).

Original language	English
Pages (from-to)	671-673
Number of pages	3
Journal	Information Processing Letters
Volume	111
Issue number	14
DOIs	https://doi.org/10.1016/j.ipl.2011.04.006
State	Published - 31 Jul 2011
Externally published	Yes

Keywords

Distributed systems
Graph algorithms
Labeling schemes
Shortest paths

Access to Document

10.1016/j.ipl.2011.04.006

Cite this

@article{a15984b33a574ac8be4a787ce18b5507,

title = "A note on exact distance labeling",

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{\^a}'{\v Z}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 Ω(n).",

keywords = "Distributed systems, Graph algorithms, Labeling schemes, Shortest paths",

author = "Oren Weimann and David Peleg",

year = "2011",

month = jul,

day = "31",

doi = "10.1016/j.ipl.2011.04.006",

language = "אנגלית",

volume = "111",

pages = "671--673",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier",

number = "14",

}

TY - JOUR

T1 - A note on exact distance labeling

AU - Weimann, Oren

AU - Peleg, David

PY - 2011/7/31

Y1 - 2011/7/31

N2 - 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 Ω(n).

AB - 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 Ω(n).

KW - Distributed systems

KW - Graph algorithms

KW - Labeling schemes

KW - Shortest paths

UR - http://www.scopus.com/inward/record.url?scp=79955747129&partnerID=8YFLogxK

U2 - 10.1016/j.ipl.2011.04.006

DO - 10.1016/j.ipl.2011.04.006

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:79955747129

SN - 0020-0190

VL - 111

SP - 671

EP - 673

JO - Information Processing Letters

JF - Information Processing Letters

IS - 14

ER -

A note on exact distance labeling

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this