Forbidden-set distance labels for graphs of bounded doubling dimension

Ittai Abraham*, Shiri Chechik, Cyril Gavoille, David Peleg

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

10 Scopus citations

Abstract

The paper proposes a forbidden-set labeling scheme for the family of graphs with doubling dimension bounded by α. For an n-vertex graph G in this family, and for any desired precision parameter ε > 0, the labeling scheme stores an O(1+ε-1) log2 n-bit label at each vertex. Given the labels of two end-vertices s and t, and the labels of a set F of "forbidden" vertices and/or edges, our scheme can compute, in time polynomial in the length of the labels, a 1+ε stretch approximation for the distance between s and t in the graph G\F. The labeling scheme can be extended into a forbidden-set labeled routing scheme with stretch 1 + ε for graphs of bounded doubling dimension.

Original languageEnglish
Title of host publicationPODC'10 - Proceedings of the 2010 ACM Symposium on Principles of Distributed Computing
Pages192-200
Number of pages9
DOIs
StatePublished - 2010
Externally publishedYes
Event29th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 2010 - Zurich, Switzerland
Duration: 25 Jul 201028 Jul 2010

Publication series

NameProceedings of the Annual ACM Symposium on Principles of Distributed Computing

Conference

Conference29th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 2010
Country/TerritorySwitzerland
CityZurich
Period25/07/1028/07/10

Keywords

  • Compact routing
  • Distance labeling
  • Doubling dimension
  • Fault-tolerance
  • Forbidden sets

Fingerprint

Dive into the research topics of 'Forbidden-set distance labels for graphs of bounded doubling dimension'. Together they form a unique fingerprint.

Cite this