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 条
  • [21] EFFICIENT PARALLEL ALGORITHMS FOR SHORTEST PATHS IN PLANAR DIGRAPHS
    PANTZIOU, GE
    SPIRAKIS, PG
    ZAROLIAGIS, CD
    [J]. BIT, 1992, 32 (02): : 215 - 236
  • [22] Levelwise Mesh Sparsification for Shortest Path Queries
    Miyamoto, Yuichiro
    Uno, Takeaki
    Kubo, Mikio
    [J]. ALGORITHMS AND COMPUTATION, PT I, 2010, 6506 : 121 - +
  • [23] An optimal data structure for shortest rectilinear path queries in a simple rectilinear polygon
    Schuierer, S
    [J]. INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 1996, 6 (02) : 205 - 225
  • [24] Shortest Beer Path Queries in Outerplanar Graphs
    Bacic, Joyce
    Mehrabi, Saeed
    Smid, Michiel
    [J]. ALGORITHMICA, 2023, 85 (06) : 1679 - 1705
  • [25] COMPUTATION OF SHORTEST PATH IN GRAPHS AND APPROPRIATE DATA STRUCTURES
    BRAESS, D
    [J]. COMPUTING, 1971, 8 (1-2) : 171 - &
  • [26] Shortest Path Queries in Mobile Broadcast Environments
    Su, Ta-Chih
    Hsieh, Yun-Tung
    Liu, Chuan-Ming
    [J]. 2009 17TH INTERNATIONAL CONFERENCE ON GEOINFORMATICS, VOLS 1 AND 2, 2009, : 954 - 959
  • [27] Shortest Beer Path Queries in Outerplanar Graphs
    Joyce Bacic
    Saeed Mehrabi
    Michiel Smid
    [J]. Algorithmica, 2023, 85 : 1679 - 1705
  • [28] SHORTEST PATH TO A SEGMENT AND QUICKEST VISIBILITY QUERIES
    Arkin, Esther M.
    Efrat, Alon
    Knauer, Christian
    Mitchell, Joseph S. B.
    Polishchuk, Valentin
    Rote, Guenter
    Schlipf, Lena
    Talvitie, Topi
    [J]. JOURNAL OF COMPUTATIONAL GEOMETRY, 2016, 7 (02) : 77 - 100
  • [29] Shortest-Path Queries in Static Networks
    Sommer, Christian
    [J]. ACM COMPUTING SURVEYS, 2014, 46 (04)
  • [30] Learning Hypertrees From Shortest Path Queries
    Fallat, Shaun M.
    Maliuk, Valerii
    Mojallal, Seyed Ahmad
    Zilles, Sandra
    [J]. INTERNATIONAL CONFERENCE ON ALGORITHMIC LEARNING THEORY, VOL 237, 2024, 237
12345