Efficient Dynamic Approximate Distance Oracles for Vertex-Labeled Planar Graphs

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 als...

Celý popis

Podrobná bibliografia

Vydané v:	Theory of computing systems Ročník 63; číslo 8; s. 1849 - 1874
Hlavní autori:	Laish, Itay, Mozes, Shay
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.11.2019 Springer Nature B.V
Predmet:	Computer Science Data structures Graphs Special Issue on Approximation and Online Algorithms Theory of Computation cover Approximate distance oracles Vertex labels Portals Planar graphs
ISSN:	1432-4350, 1433-0490
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!