Abstract
In this paper we present space-query trade-offs for external memory data structures that answer shortest path queries on planar directed graphs. For any S = Ω(N1+ε) and S = O(N2/B), our main result is a family of structures that use S space and answer queries in O(N 2/SB) I/Os, thus obtaining optimal space-query product O(N 2/B). An S space structure can be constructed in O(√S · sort(TV)) I/Os, where sort(TV) is the number of I/Os needed to sort N elements, B is the disk block size, and N is the size of the graph. © Springer-Verlag Berlin Heidelberg 2005.
Cite
CITATION STYLE
Arge, L., & Toma, L. (2005). External data structures for shortest path queries on planar digraphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3827 LNCS, pp. 328–338). https://doi.org/10.1007/11602613_34
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
