A note on exact distance labeling

Oren Weimann, David Peleg

Research output: Contribution to journalArticlepeer-review


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 languageEnglish
Pages (from-to)671-673
Number of pages3
JournalInformation Processing Letters
Issue number14
StatePublished - 31 Jul 2011
Externally publishedYes


  • Distributed systems
  • Graph algorithms
  • Labeling schemes
  • Shortest paths

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Signal Processing
  • Information Systems
  • Computer Science Applications


Dive into the research topics of 'A note on exact distance labeling'. Together they form a unique fingerprint.

Cite this