Truly Subquadratic Exact Distance Oracles with Constant Query Time for Planar Graphs

Abstract

Given an undirected, unweighted planar graph $G$ with $n$ vertices, we present a truly subquadratic size distance oracle for reporting exact shortest-path distances between any pair of vertices of $G$ in constant time. For any $\epsilon >0$, our distance oracle takes up $O(n^{5/3+\epsilon })$ space and is capable of answering shortest-path distance queries exactly for any pair of vertices of $G$ in worst-case time $O(\log (1/\epsilon ))$. Previously no truly sub-quadratic size distance oracles with constant query time for answering exact all-pairs shortest paths distance queries existed.