A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
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α log 2 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 thedoi:10.1145/1835698.1835743 dblp:conf/podc/AbrahamCGP10 fatcat:olj5dfhklnaypa2v546luzh4ca