Itay Laish

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
Let G be a graph where each vertex is associated with a label. A Vertex-Labeled Approximate Distance Oracle is a data structure that, given a vertex v and a label λ, returns a (1 + ε)-approximation of the distance from v to the closest vertex with label λ in G. Such an oracle is dynamic if it also supports label changes. In this paper we present three(More)
  • 1