I/O-Efficient Path Traversal in Succinct Planar Graphs

被引:0
|
作者
Craig Dillabaugh
Meng He
Anil Maheshwari
Norbert Zeh
机构
[1] Carleton University,School of Computer Science
[2] Dalhousie University,Faculty of Computer Science
[3] Dalhousie University,Faculty of Computer Science
来源
Algorithmica | 2017年 / 77卷
关键词
External memory algorithms; Path traversal; Planar graphs; Succinct data structures;
D O I
暂无
中图分类号
学科分类号
摘要
We present a technique for representing bounded-degree planar graphs in a succinct fashion while permitting I/O-efficient traversal of paths. Using our representation, a graph with N vertices, (In this paper lgN\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\lg {N}$$\end{document} denotes log2N\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\log _2{N}$$\end{document}) each with an associated key of q=OlgN\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$q= \mathrm {O}\left( \lg N\right) $$\end{document} bits, can be stored in Nq+ON+oNq\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$Nq+ \mathrm {O}\left( N\right) + \mathrm {o}\left( Nq\right) $$\end{document} bits and traversing a path of length K takes OK/lgB\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathrm {O}\left( K / \lg B\right) $$\end{document} I/Os, where B denotes the disk block size. By applying our construction to the dual of a terrain represented as a triangular irregular network, we can represent the terrain in the above space bounds and support path traversals on the terrain using OK/lgB\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathrm {O}\left( K / \lg B\right) $$\end{document} I/Os, where K is the number of triangles visited by the path. This is useful for answering a number of queries on the terrain, such as reporting terrain profiles, trickle paths, and connected components.
引用
收藏
页码:714 / 755
页数:41
相关论文
共 50 条
  • [1] I/O-Efficient Path Traversal in Succinct Planar Graphs
    Dillabaugh, Craig
    He, Meng
    Maheshwari, Anil
    Zeh, Norbert
    [J]. ALGORITHMICA, 2017, 77 (03) : 714 - 755
  • [2] I/O and Space-Efficient Path Traversal in Planar Graphs
    Dillabaugh, Craig
    He, Meng
    Maheshwari, Anil
    Zeh, Norbert
    [J]. ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2009, 5878 : 1175 - +
  • [3] I/O-efficient algorithms on near-planar graphs
    Haverkort, H
    Toma, L
    [J]. LATIN 2006: THEORETICAL INFORMATICS, 2006, 3887 : 580 - 591
  • [4] I/O-efficient planar separators
    Maheshwari, Anil
    Zeh, Norbert
    [J]. SIAM JOURNAL ON COMPUTING, 2008, 38 (03) : 767 - 801
  • [5] Multiway Simple Cycle Separators and I/O-Efficient Algorithms for Planar Graphs
    Arge, Lars
    van Walderveen, Freek
    Zeh, Norbert
    [J]. PROCEEDINGS OF THE TWENTY-FOURTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA 2013), 2013, : 901 - 918
  • [6] Succinct and I/O Efficient Data Structures for Traversal in Trees
    Dillabaugh, Craig
    He, Meng
    Maheshwari, Anil
    [J]. ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2008, 5369 : 112 - 123
  • [7] Succinct and I/O Efficient Data Structures for Traversal in Trees
    Dillabaugh, Craig
    He, Meng
    Maheshwari, Anil
    [J]. ALGORITHMICA, 2012, 63 (1-2) : 201 - 223
  • [8] Succinct and I/O Efficient Data Structures for Traversal in Trees
    Craig Dillabaugh
    Meng He
    Anil Maheshwari
    [J]. Algorithmica, 2012, 63 : 201 - 223
  • [9] I/O-efficient algorithms for sparse graphs
    Toma, L
    Zeh, N
    [J]. ALGORITHMS FOR MEMORY HIERARCHIES: ADVANCED LECTURES, 2003, 2625 : 85 - 109
  • [10] I/O-Efficient Algorithms for Graphs of Bounded Treewidth
    Maheshwari, Anil
    Zeh, Norbert
    [J]. ALGORITHMICA, 2009, 54 (03) : 413 - 469