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 条
12345