共 50 条
- [1] Finding Longest (s, t)-paths of O-shaped Supergrid Graphs in Linear Time [J]. 2019 IEEE 10TH INTERNATIONAL CONFERENCE ON AWARENESS SCIENCE AND TECHNOLOGY (ICAST 2019), 2019, : 252 - 259
- [2] A Polynomial Time Algorithm for Longest Paths in Biconvex Graphs [J]. WALCOM: ALGORITHMS AND COMPUTATION, 2011, 6552 : 191 - 201
- [6] RECOGNIZING OUTERPLANAR GRAPHS IN LINEAR TIME [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1987, 246 : 165 - 176
- [7] A Linear Time Algorithm for Computing Longest Paths in 2-Trees [J]. ARS COMBINATORIA, 2013, 112 : 329 - 351
- [8] Longest (s, t)-paths in L-shaped grid graphs [J]. OPTIMIZATION METHODS & SOFTWARE, 2019, 34 (04): : 797 - 826
- [9] Planar rectilinear drawings of outerplanar graphs in linear time [J]. COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2022, 103