@inproceedings{91ba8482bef242858433095e2d70cb81,

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

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)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 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.",

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

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

year = "2010",

doi = "10.1145/1835698.1835743",

language = "אנגלית",

isbn = "9781605588889",

series = "Proceedings of the Annual ACM Symposium on Principles of Distributed Computing",

pages = "192--200",

booktitle = "PODC'10 - Proceedings of the 2010 ACM Symposium on Principles of Distributed Computing",

note = "29th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 2010 ; Conference date: 25-07-2010 Through 28-07-2010",

}