Efficient Dynamic Approximate Distance Oracles for Vertex-Labeled Planar Graphs

Itay Laish, Shay Mozes

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 $\lambda$, returns…