Conference paper
Planar Reachability in Linear Space and Constant Time
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].
| Language: | English |
|---|---|
| Publisher: | IEEE Computer Society Press |
| Year: | 2015 |
| Pages: | 370-389 |
| Proceedings: | 56th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2015 |
| Series: | Symposium on Foundations of Computer Science. Annual Proceedings |
| ISBN: | 1467381918 , 1467381926 , 9781467381918 and 9781467381925 |
| ISSN: | 02725428 , 15238288 and 25758454 |
| Types: | Conference paper |
| DOI: | 10.1109/FOCS.2015.30 |
| ORCIDs: | Rotenberg, Eva , 0000-0001-6997-9251 and 0000-0001-5237-1709 |
