Finding Optimal Paths of All Lengths in Directed Grid Graphs

被引：0
|
作者：
Arslan, Abdullah N. [1 ]
机构：
[1] Texas A&M Univ Commerce, Dept Comp Sci, Commerce, TX 75428 USA
来源：
ARTIFICIAL INTELLIGENCE TRENDS IN SYSTEMS, VOL 2 | 2022年 / 502卷
关键词：
Path optimization problem; Grid graph; Parallel algorithm; Dynamic programming; Suffix tree; Path graph; CONSTRUCTION;
D O I：
10.1007/978-3-031-09076-9_33
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
We study a problem of finding optimal paths of all lengths on a directed edge-weighted grid graph. Variations of this problem appear in different contexts using similar frame-works. We propose sequential and parallel algorithms for it. Our algorithms have applications for k-vertex problem in one dimension, and edit distance problem in two dimensions. They offer fast solutions for special cases of these problems.
引用
收藏
页码：362 / 380
页数：19
相关论文
共 50 条
  • [31] OPTIMAL PATHS IN GRAPHS ZONE
    Cozac, Ion
    PROCEEDINGS OF THE EUROPEAN INTEGRATION: BETWEEN TRADITION AND MODERNITY, VOL 2, 2007, : 674 - 682
  • [32] The location of median paths on grid graphs
    Becker, Ronald I.
    Lari, Isabella
    Scozzari, Andrea
    Storchi, Giovanni
    ANNALS OF OPERATIONS RESEARCH, 2007, 150 (01) : 65 - 78
  • [33] Approximating the longest paths in grid graphs
    Zhang, Wen-Qi
    Liu, Yong-Jin
    THEORETICAL COMPUTER SCIENCE, 2011, 412 (39) : 5340 - 5350
  • [34] Vertex Contact Graphs of Paths on a Grid
    Aerts, Nieke
    Felsner, Stefan
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2014, 8747 : 56 - 68
  • [35] The location of median paths on grid graphs
    Ronald I. Becker
    Isabella Lari
    Andrea Scozzari
    Giovanni Storchi
    Annals of Operations Research, 2007, 150 : 65 - 78
  • [36] All Pairs Shortest Paths in weighted directed graphs exact and almost exact algorithms
    Zwick, U
    39TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 1998, : 310 - 319
  • [37] On Sampling Simple Paths in Planar Graphs According to Their Lengths
    Montanari, Sandro
    Penna, Paolo
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2015, PT II, 2015, 9235 : 493 - 504
  • [38] Finding RkNN Set in Directed Graphs
    Sahu, Pankaj
    Agrawal, Prachi
    Goyal, Vikram
    Bera, Debajyoti
    DISTRIBUTED COMPUTING AND INTERNET TECHNOLOGY, ICDCIT 2015, 2015, 8956 : 162 - 173
  • [39] RECOGNITION ALGORITHM FOR INTERSECTION GRAPHS OF DIRECTED PATHS IN DIRECTED TREES
    GAVRIL, F
    DISCRETE MATHEMATICS, 1975, 13 (03) : 237 - 249
  • [40] Finding all hops shortest paths
    Cheng, G
    Ansari, N
    IEEE COMMUNICATIONS LETTERS, 2004, 8 (02) : 122 - 124
12345