Year: 2014
Type: preprint
Abstract: We show how to represent a planar digraph in linear space so that distance queries can be answered in constant time. The data structure can be constructed in linear time. This representation of reachability is thus optimal in both time and space, and has optimal construction time. The previous best solution used $O(n\log n)$ space for constant query time [Thorup FOCS'01].
Source: arXiv (Cornell University)
Authors: Holm, Jacob, Rotenberg, Eva, Thorup, Mikkel
Institution: University of Copenhagen
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
Funder: Danmarks Frie Forskningsfond
OpenAlex ID: W2953372607