Return to Question

For every $a,b \in T$, $d(a,b)$ is known. This is called the "global knowledge". Also for every $x \in V, a \in T$, the distance $d(x,a)$ is known. This is called the "local knowledge" for the vertex $x$.

For every $a,b \in T$, $d(a,b)$ is known. This is called the "global knowledge". Also for every $x \in V, a \in T$, the distance $d(x,a)$ is known. $A(x)$ is also known from $x$. This is called the "local knowledge" for the vertex $x$.

It seems like this not problem is not solvable in the "exact" sense, as it is possible to have two different vertices with the same set of "coordinates" on some specially crafted graph. (In that case, The Address of a vertex does not really define it). However I assume that the probability of getting this kind of special graph is very low.

It seems like this not problem is not solvable in the "exact" sense, as it is possible to have two different vertices with the same set of "coordinates" on some specially crafted graph. (In that case, The Address of a vertex does not really define it). However I think that the probability of getting this kind of special graph is very low.