A Retroactive Approach for Dynamic Shortest Path Problem
Sign Up to like & getrecommendations! Published in 2018 at "National Academy Science Letters"
DOI: 10.1007/s40009-018-0674-6
Abstract: AbstractDynamic 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… read more here.
Keywords: retroactive approach; approach dynamic; path problem; path ... See more keywords