External data structures for shortest path queries on planar digraphs

被引：0
|
作者：
Arge, L [1 ]
Toma, L
机构：
[1] Duke Univ, Durham, NC 27708 USA
[2] Bowdoin Coll, Brunswick, ME 04011 USA
来源：
ALGORITHMS AND COMPUTATION | 2005年 / 3827卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
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 = Omega(N1+epsilon) and S = O(N-2/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(root S center dot sort(N)) I/Os, where sort(N) 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.
引用
收藏
页码：328 / 338
页数：11
相关论文
共 50 条
  • [1] Efficient algorithms for shortest path queries in planar digraphs
    Djidjev, HN
    [J]. GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 1997, 1197 : 151 - 165
  • [2] Shortest path queries in digraphs of small treewidth
    Chaudhuri, S
    Zaroliagis, CD
    [J]. AUTOMATA, LANGUAGES AND PROGRAMMING, 1995, 944 : 244 - 255
  • [3] An external memory data structure for shortest path queries
    Hutchinson, D
    Maheshwari, A
    Zeh, N
    [J]. DISCRETE APPLIED MATHEMATICS, 2003, 126 (01) : 55 - 82
  • [4] Parallel Shortest-Path Queries in Planar Graphs
    Aleksandrov, Lyudmil
    Chapuis, Guillaume
    Djidjev, Hristo
    [J]. PROCEEDINGS OF THE ACM WORKSHOP ON HIGH PERFORMANCE GRAPH PROCESSING (HPGP'16), 2016, : 9 - 16
  • [5] Data Structures for Path Queries
    He, Meng
    Munro, J. Ian
    Zhou, Gelin
    [J]. ACM TRANSACTIONS ON ALGORITHMS, 2016, 12 (04)
  • [6] Shortest-Path Queries in Planar Graphs on GPU-Accelerated Architectures
    Chapuis, Guillaume
    Djidjev, Hristo
    [J]. LARGE-SCALE SCIENTIFIC COMPUTING, LSSC 2015, 2015, 9374 : 53 - 60
  • [7] Succinct Data Structures for Path Queries
    He, Meng
    Munro, J. Ian
    Zhou, Gelin
    [J]. ALGORITHMS - ESA 2012, 2012, 7501 : 575 - 586
  • [8] A simple parallel algorithm for the single-source shortest path problem on planar digraphs
    Träff, JL
    [J]. JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2000, 60 (09) : 1103 - 1124
  • [9] Proxies for Shortest Path and Distance Queries
    Ma, Shuai
    Feng, Kaiyu
    Li, Jianxin
    Wang, Haixun
    Cong, Gao
    Huai, Jinpeng
    [J]. IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2016, 28 (07) : 1835 - 1850
  • [10] SHORTEST PATH QUERIES IN RECTILINEAR WORLDS
    De Berg, Mark
    Van Kreveld, Marc
    Nilsson, Bengt J.
    Overmars, Mark
    [J]. INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 1992, 2 (03) : 287 - 309
12345