We consider distance queries in vertex-labeled planar graphs. For any fixed 0 < 𝜖 ≤ 1/2 we show how to preprocess a directed planar graph with vertex labels and arc lengths into a data structure that answers queries of the following form. Given a vertex u and a label λ return a (1 + 𝜖)-approximation of the distance from u to its closest vertex with label λ. For a directed planar graph with n vertices, such that the ratio of the largest to smallest arc length is bounded by N, the preprocessing time is O(𝜖 − 2 n lg 3n lg(n N)), the data structure size is O(𝜖 − 1 n lg n lg(n N)), and the query time is O(lg lg n lg lg(n N) + 𝜖 − 1). We also point out that a vertex label distance oracle for undirected planar graphs suggested in an earlier version of this paper is incorrect.
Theory of Computing Systems – Springer Journals
Published: Dec 12, 2017
It’s your single place to instantly
discover and read the research
that matters to you.
Enjoy affordable access to
over 12 million articles from more than
10,000 peer-reviewed journals.
All for just $49/month
It’s easy to organize your research with our built-in tools.
All the latest content is available, no embargo periods.
“Whoa! It’s like Spotify but for academic articles.”@Phil_Robichaud