Back to Search Start Over

Planar Reachability in Linear Space and Constant Time

Authors :
Holm, Jacob
Rotenberg, Eva
Thorup, Mikkel
Publication Year :
2014

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].<br />Comment: 20 pages, 5 figures, submitted to FoCS

Details

Database :
arXiv
Publication Type :
Report
Accession number :
edsarx.1411.5867
Document Type :
Working Paper