A Retroactive Approach for Dynamic Shortest Path Problem

被引：1
|
作者：
Sunita [1 ]
Garg, Deepak [1 ]
机构：
[1] Thapar Univ, Patiala, Punjab, India
来源：
NATIONAL ACADEMY SCIENCE LETTERS-INDIA | 2019年 / 42卷 / 01期
关键词：
Retroactive data structures; Dynamic Dijkstra; Shortest path problem;
D O I：
10.1007/s40009-018-0674-6
中图分类号：
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号：
07 ; 0710 ; 09 ;
摘要：
Dynamic shortest path algorithms modify the existing shortest path tree or graph, taking into account changes in the underlying graph configuration. In the premise of this paper, the dynamic Dijkstra algorithm is specifically considered which is used for the solution of single source shortest path problem in dynamic graphs. Dynamic Single Source Shortest Path (DSSSP) problem is considered from a completely different perspective. For incorporating the dynamic changes into the solution, the retroactive data structure has been used. Dynamics of retroactive data structures provide a natural order for propagating the desired changes in the underlying graph configuration. DSSSP has been solved in efficient way with worst case complexity O(m log n) and also proved the correctness of our proposed algorithm.
引用
收藏
页码：25 / 32
页数：8
相关论文
共 50 条
  • [1] A Retroactive Approach for Dynamic Shortest Path Problem
    Deepak Sunita
    National Academy Science Letters, 2019, 42 : 25 - 32
  • [2] Dynamizing Dijkstra: A solution to dynamic shortest path problem through retroactive priority queue
    Sunita
    Garg, Deepak
    JOURNAL OF KING SAUD UNIVERSITY-COMPUTER AND INFORMATION SCIENCES, 2021, 33 (03) : 364 - 373
  • [3] The dynamic shortest path problem with anticipation
    Thomas, Barrett W.
    White, Chelsea C., III
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 176 (02) : 836 - 854
  • [4] A spectral approach to the shortest path problem
    Steinerberger, Stefan
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2021, 620 : 182 - 200
  • [5] Dynamic relative robust shortest path problem
    Xu, Bo
    Zhou, Xizhao
    COMPUTERS & INDUSTRIAL ENGINEERING, 2020, 148
  • [6] Dynamic relative robust shortest path problem
    Xu, Bo
    Zhou, Xizhao
    Computers and Industrial Engineering, 2020, 148
  • [7] A new approach for the fuzzy shortest path problem
    Chuang, TN
    Kung, JY
    Computational Intelligence for Modelling and Prediction, 2005, 2 : 89 - 100
  • [8] An approach to the distributionally robust shortest path problem
    Ketkov, Sergey S.
    Prokopyev, Oleg A.
    Burashnikov, Evgenii P.
    COMPUTERS & OPERATIONS RESEARCH, 2021, 130
  • [9] The multi-objective dynamic shortest path problem
    da Silva, Juarez M.
    Ramos, Gabriel de O.
    Barbosa, Jorge L., V
    2022 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2022,
  • [10] SH: A Novel Method for the Dynamic and Shortest Path Problem
    Guo, Yafei
    Qin, Zheng
    Guo, Ronghua
    Ji, Lei
    MATERIALS AND MANUFACTURING TECHNOLOGY, PTS 1 AND 2, 2010, 129-131 : 1013 - +
12345