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 条
  • [41] Finding paths in tree graphs with a quantum walk
    Koch, Daniel
    Hillery, Mark
    PHYSICAL REVIEW A, 2018, 97 (01)
  • [42] A new path algebra for finding paths in graphs
    Manger, R
    ITI 2004: PROCEEDINGS OF THE 26TH INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY INTERFACES, 2004, : 657 - 662
  • [43] Packing and finding paths in sparse random graphs
    Iršič, Vesna
    Portier, Julien
    Versteegen, Leo
    arXiv,
  • [44] Finding meaningful paths in heterogeneous graphs with PathWays
    Barret, Nelly
    Gauquier, Antoine
    Law, Jia-Jean
    Manolescu, Ioana
    INFORMATION SYSTEMS, 2025, 127
  • [45] Finding paths in graphs avoiding forbidden transitions
    Szeider, S
    DISCRETE APPLIED MATHEMATICS, 2003, 126 (2-3) : 261 - 273
  • [46] Proper circular arc graphs as intersection graphs of paths on a grid
    Galby, Esther
    Pia Mazzoleni, Maria
    Ries, Bernard
    DISCRETE APPLIED MATHEMATICS, 2019, 262 : 195 - 202
  • [47] A Combinatorial Algorithm for All-Pairs Shortest Paths in Directed Vertex-Weighted Graphs with Applications to Disc Graphs
    Lingas, Andrzej
    Sledneu, Dzmitry
    SOFSEM 2012: THEORY AND PRACTICE OF COMPUTER SCIENCE, 2012, 7147 : 373 - +
  • [48] Reliable Hubs for Partially-Dynamic All-Pairs Shortest Paths in Directed Graphs
    Karczmarz, Adam
    Lacki, Jakub
    27TH ANNUAL EUROPEAN SYMPOSIUM ON ALGORITHMS (ESA 2019), 2019, 144
  • [49] Efficient Parallel Algorithms for Computing All Pair Shortest Paths in Directed Graphs1
    Han, Yijie
    Pan, V.Y.
    Reif, J.H.
    Algorithmica (New York), 1997, 17 (04): : 399 - 415
  • [50] Finding optimal paths in MREP routing
    Fleischer, R
    Golin, M
    Lea, CT
    Wong, S
    INFORMATION PROCESSING LETTERS, 2004, 89 (02) : 57 - 63
12345