Before revision: Thus, it can be characterized as an embedding of the graph with the property that for every two nodes x and t, there exists a neighbor y of x such that d(x,t) > d(y, y ), where d denotes the distance in the embedded space.
After revision: Thus, it can be characterized as an embedding of the graph with the propertt that for every two nodes x and t, there exists a neighbor y of x such that d(x,t) > d(y, y ), where d denotes the distance in the embedded space.