Longest (s, t)-paths in L-shaped grid graphs

被引：3
|
作者：
Keshavarz-Kohjerdi, Fatemeh [1 ]
Bagheri, Alireza [2 ]
机构：
[1] Shahed Univ, Dept Comp Sci, Tehran, Iran
[2] Amirkabir Univ Technol, Dept Comp Engn & IT, Tehran, Iran
来源：
OPTIMIZATION METHODS & SOFTWARE | 2019年 / 34卷 / 04期
关键词：
grid graph; Hamiltonian path; L-shaped grid graph; longest path; FINDING HAMILTONIAN (S; LINEAR-TIME ALGORITHM; PATHS; CYCLES;
D O I：
10.1080/10556788.2018.1460665
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
The longest path problem, that is, finding a simple path with the maximum number of vertices, is a well-known NP-hard problem with many applications. However, for some classes of graphs, including solid grid graphs and grid graphs with some holes, it is open. An L-shaped grid graph is a special kind of a rectangular grid graph with a rectangular hole. In this paper, we show that a longest path between two given vertices s and t of an L-shaped grid graph can be computed in linear time.
引用
收藏
页码：797 / 826
页数：30
相关论文
共 50 条
  • [1] Hamiltonian paths in L-shaped grid graphs
    Keshavarz-Kohjerdi, Fatemeh
    Bagheri, Alireza
    THEORETICAL COMPUTER SCIENCE, 2016, 621 : 37 - 56
  • [2] The hamiltonicity, hamiltonian connectivity, and longest (s, t)-path of L-shaped supergrid graphs
    Keshavarz-Kohjerdi, Fatemeh
    Hung, Ruo-Wei
    IAENG International Journal of Computer Science, 2020, 47 (03): : 378 - 391
  • [3] Edge intersection graphs of L-shaped paths in grids
    Cameron, Kathie
    Chaplick, Steven
    Hoang, Chinh T.
    DISCRETE APPLIED MATHEMATICS, 2016, 210 : 185 - 194
  • [4] Linear-time algorithms for finding Hamiltonian and longest (s, t)-paths in C-shaped grid graphs
    Keshavarz-Kohjerdi, Fatemeh
    Bagheri, Alireza
    DISCRETE OPTIMIZATION, 2020, 35
  • [5] Approximating the longest paths in grid graphs
    Zhang, Wen-Qi
    Liu, Yong-Jin
    THEORETICAL COMPUTER SCIENCE, 2011, 412 (39) : 5340 - 5350
  • [6] Reconfiguring Hamiltonian Cycles in L-Shaped Grid Graphs
    Nishat, Rahnuma Islam
    Whitesides, Sue
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE (WG 2019), 2019, 11789 : 325 - 337
  • [7] Finding Longest (s, t)-paths of O-shaped Supergrid Graphs in Linear Time
    Hung, Ruo-Wei
    Keshavarz-Kohjerdi, Fatemeh
    Tseng, Yuh-Min
    Qiu, Guo-Hao
    2019 IEEE 10TH INTERNATIONAL CONFERENCE ON AWARENESS SCIENCE AND TECHNOLOGY (ICAST 2019), 2019, : 252 - 259
  • [8] Finding Hamiltonian and Longest (s,t)-Paths of C-Shaped Supergrid Graphs in Linear Time
    Keshavarz-Kohjerdi, Fatemeh
    Hung, Ruo-Wei
    ALGORITHMS, 2022, 15 (02)
  • [9] A bandwidth reduction algorithm for L-shaped and Z-shaped grid structured graphs
    Doss, L. Jones Tarcius
    Arathi, P.
    OPERATIONS RESEARCH LETTERS, 2011, 39 (06) : 441 - 446
  • [10] A LINEAR TIME ALGORITHM FOR LONGEST (S,T)-PATHS IN WEIGHTED OUTERPLANAR GRAPHS
    ELLIS, JA
    MATA, M
    MACGILLIVRAY, G
    INFORMATION PROCESSING LETTERS, 1989, 32 (04) : 199 - 204
12345