Title :
Planar Reachability in Linear Space and Constant Time
Author :
Jacob Holm;Eva Rotenberg;Mikkel Thorup
Author_Institution :
Dept. of Comput. Sci., Univ. of Copenhagen, Copenhagen, Denmark
Abstract :
We show how to represent a planar digraph in linear space so that reach ability queries can be answered in constant time. The data structure can be constructed in linear time. This representation of reach ability 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].
Keywords :
"Vegetation","Data structures","Random access memory","Computational modeling","Computer science","Transmission line matrix methods","Upper bound"
Conference_Titel :
Foundations of Computer Science (FOCS), 2015 IEEE 56th Annual Symposium on
DOI :
10.1109/FOCS.2015.30
