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 条
  • [21] Vertices of Paths of Minimal Lengths on Suborbital Graphs
    Deger, Ali Hikmet
    FILOMAT, 2017, 31 (04) : 913 - 923
  • [22] Finding Disjoint Paths in Split Graphs
    Pinar Heggernes
    Pim van ’t Hof
    Erik Jan van Leeuwen
    Reza Saei
    Theory of Computing Systems, 2015, 57 : 140 - 159
  • [23] Finding Disjoint Paths in Split Graphs
    Heggernes, Pinar
    Van't Hof, Pim
    van Leeuwen, Erik Jan
    Saei, Reza
    THEORY OF COMPUTING SYSTEMS, 2015, 57 (01) : 140 - 159
  • [24] Finding Colorful Paths in Temporal Graphs
    Dondi, Riccardo
    Hosseinzadeh, Mohammad Mehdi
    COMPLEX NETWORKS & THEIR APPLICATIONS X, VOL 1, 2022, 1015 : 553 - 565
  • [25] Finding Disjoint Paths in Split Graphs
    Heggernes, Pinar
    van 't Hof, Pim
    van Leeuwen, Erik Jan
    Saei, Reza
    SOFSEM 2014: THEORY AND PRACTICE OF COMPUTER SCIENCE, 2014, 8327 : 315 - 326
  • [26] Matchings of cycles and paths in directed graphs
    Pap, Gyula
    Szego, Laszlo
    COMBINATORICA, 2007, 27 (03) : 383 - 398
  • [27] Paths and circuits in partially directed graphs
    Barnette, DW
    Gillett, S
    DISCRETE MATHEMATICS, 1999, 195 (1-3) : 239 - 243
  • [28] Paths and circuits in partially directed graphs
    Discrete Math, 1-3 (239-243):
  • [29] Matchings of cycles and paths in directed graphs
    Gyula Pap
    László Szegő
    Combinatorica, 2007, 27 : 383 - 398
  • [30] Disjoint directed cycles with specified lengths in directed bipartite graphs
    Gao, Yunshu
    Wang, Hong
    Zou, Qingsong
    DISCRETE MATHEMATICS, 2021, 344 (04)
12345