@article{f73c5af987f24d1c9b09abcbcef48b54,

title = "Forbidden-set distance labels for graphs of bounded doubling dimension",

abstract = "This article proposes a forbidden-set labeling scheme for the family of unweighted 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)2α 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 O(1 + ϵ)2α · |F|2 log n time, 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.",

keywords = "Compact routing, Distance labeling, Doubling dimension, Fault-tolerance, Forbidden sets",

author = "Ittai Abraham and Shiri Chechik and Cyril Gavoille and David Peleg",

note = "Publisher Copyright: {\textcopyright} 2016 ACM.",

year = "2016",

month = feb,

doi = "10.1145/2818694",

language = "אנגלית",

volume = "12",

journal = "ACM Transactions on Algorithms",

issn = "1549-6325",

publisher = "Association for Computing Machinery (ACM)",

number = "2",

}