BibTeX
CSL-JSON
MLA
Harvard
Efficient Dynamic Approximate Distance Oracles for Vertex-Labeled Planar
Graphs
release_zw3jpwi6nvdkbi5ehqrecs2hxy
by
Itay Laish, Shay Mozes
Released
as a article
.
2017
Abstract
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 different dynamic approximate vertex-labeled distance oracles for
planar graphs, all with polylogarithmic query and update times, and nearly
linear space requirements.
In text/plain
format
Archived Files and Locations
application/pdf 1.6 MB
file_4yslajf7cjh3znx4jo5z4mcwjm
|
arxiv.org (repository) web.archive.org (webarchive) |
Read Archived PDF
Preserved and Accessible
arXiv
1707.02414v2
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
access all versions, variants, and formats of this works (eg, pre-prints)
Cite This
Lookup Links