Sep 14, 2011 · We show how to construct a compact distance oracle that can answer queries of the form: "what is the distance from v to the closest lambda- ...
We show how to construct a compact distance oracle that can answer queries of the form: “what is the distance from v to the closest λ-labeled vertex” for a ...
We show how to construct a compact distance oracle that can answer queries of the form: "what is the distance from v to the closest λ-labeled vertex" for a ...
Improved Distance Oracles and Spanners for Vertex-Labeled Graphs. 327 dynamic vertex-label distance oracle that is capable of handling label changes in sub ...
This work constructs a compact distance oracle that answers queries of the form: "What is δ(v, λ)?", and provides a hierarchy of approximate distance ...
We show how to construct a compact distance oracle that can answer queries of the form: ``what is the distance from v to the closest \lambda-labeled node" for a ...
Abstract. Given a graph G = (V,E) with non-negative edge lengths whose vertices are assigned a label from L = {λ1,...,λℓ}, we construct a compact distance ...
Missing: Spanners | Show results with:Spanners
Nov 30, 2021 · A vertex-labeled distance oracle is a data structure which for any query consisting of a vertex u and a label λ reports the shortest path distance from u to ...
We show in Section 2 how to adapt this scheme to vertex-label oracles achieving the same performance. Theorem 1 (Thorup-Zwick Vertex-Label Distance Oracles). A ...
Missing: Improved | Show results with:Improved
Chechik, S.: Improved distance oracles and spanners for vertex-labeled graphs. In: Pro- ceedings of the 20th European Symposium on Algorithms (ESA), pp. 325 ...