The Polynomial Algorithm of Finding the Shortest Path in a Divisible Multiple Graph

被引:0
|
作者
A. V. Smirnov
机构
[1] Demidov Yaroslavl State University,
关键词
multiple graph; divisible graph; multiple path; shortest path; reachability set; polynomial algorithm;
D O I
暂无
中图分类号
学科分类号
摘要
引用
收藏
页码:841 / 853
页数:12
相关论文
共 50 条
  • [1] The Polynomial Algorithm of Finding the Shortest Path in a Divisible Multiple Graph
    Smirnov, A. V.
    AUTOMATIC CONTROL AND COMPUTER SCIENCES, 2023, 57 (07) : 841 - 853
  • [2] The Optimized Algorithm of Finding the Shortest Path in a Multiple Graph
    Smirnov, A. V.
    AUTOMATIC CONTROL AND COMPUTER SCIENCES, 2024, 58 (07) : 745 - 752
  • [3] The Polynomial Time Algorithm of the Next-to-shortest Path Problem in Directed Graph
    Zeng, Qinghong
    Yang, Qiaoyan
    2016 PPH INTERNATIONAL CONFERENCE ON SOCIAL SCIENCE AND ENVIRONMENT (PPH-SSE 2016), VOL 2, 2016, 7 : 89 - 92
  • [4] Graph-reduction algorithm for finding shortest path in Geographic Information Systems
    Puente, R. R.
    Cortes, M. L.
    IEEE LATIN AMERICA TRANSACTIONS, 2012, 10 (06) : 2201 - 2208
  • [5] Analysis of Multiple Shortest Path Finding Algorithm in Novel Gaming Scenario
    Zafar, Aqsa
    Agrawal, Krishna Kant
    Kumar, Wg. Cdr Anil
    INTELLIGENT COMMUNICATION, CONTROL AND DEVICES, ICICCD 2017, 2018, 624 : 1267 - 1274
  • [6] The Shortest Path Problem for a Multiple Graph
    Smirnov, A. V.
    AUTOMATIC CONTROL AND COMPUTER SCIENCES, 2018, 52 (07) : 625 - 633
  • [7] A graph algorithm for the time constrained shortest path
    Liu, Pan
    Huang, Wulan
    CONNECTION SCIENCE, 2022, 34 (01) : 1500 - 1518
  • [8] A multiple pairs shortest path algorithm
    Wang, IL
    Johnson, EL
    Sokol, JS
    TRANSPORTATION SCIENCE, 2005, 39 (04) : 465 - 476
  • [10] A Solution for Finding Quasi-Shortest Path with Graph Coarsening
    Iwata, Takeaki
    Kitaura, Keita
    Matsuo, Ryotaro
    Ohsaki, Hiroyuki
    36TH INTERNATIONAL CONFERENCE ON INFORMATION NETWORKING (ICOIN 2022), 2022, : 215 - 219