| http://www.w3.org/ns/prov#value | - To now compute the distance between two nodes takes three lookups: from each node to its closest landmark, and the landmark-landmark distance. this tends to work fairly well in practice, especially with graphs that contain many tree-like tendrils and a highly connected core.
|
