Labeling schemes seek to assign a short label to each node in a network, so that a function
on two nodes (such as distance or adjacency) can be computed by examining their labels …

We consider labeling schemes for trees, supporting various relationships between nodes at
small distance. For instance, we show that given a tree T and an integer k we can assign …

We consider distance labeling schemes for trees: given a tree with $ n $ nodes, label the
nodes with binary strings such that, given the labels of any two nodes, one can determine …

We consider the problem of labeling the nodes of an n-node graph G with short labels in
such a way that the distance between any two nodes u, v of G can be approximated …

We consider NCA labeling schemes: given a rooted tree T, label the nodes of T with binary
strings such that, given the labels of any two nodes, one can determine, by looking only at …

We present a labeling scheme for rooted trees which allows to compute, from the label ofv
alone, unique identifiers for the ancestors of v that are at distance at most d from v. For any …

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 …

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 …

Let f be a function on pairs of vertices. An f-labeling scheme for a family of graphs \mathcalF
labels the vertices of all graphs in \mathcalF such that for every graph G∈\mathcalF and …

We consider the problem of labeling the nodes of a graph in a way that will allow one to
compute the distance between any two nodes directly from their labels (without using any …