Searching Shortest Paths on Weakly Dynamic Graphs
In this paper, we study weakly dynamic graphs, and we propose an efficient polynomial algorithm that computes in advance shortest paths for all possible configurations. No additional computation is needed after any change in the problem because shortest paths are already known in all cases. We apply this result to a dynamic routing problem. In this problem, messages must be sent from some components (captors for example) to a specific one (a processor for example) as quickly as possible. The actual network is a mesh and the problem can represented by a weighted directed acyclic graph. One known arc has unreliable performances.
KeywordsShortest paths Dynamic graphs Route planning
- 9.Balev S, Guinand F, Pigné Y (2007) Maintaining shortest paths in dynamic graphs. In: Proceedings of the international conference on non-convex programming: local and global approaches theory, algorithms and applications (NCP’07), Rouen, December 17–21, pp 17–21 Google Scholar
- 10.Mao H (2008) Pathfinding algorithms for mutating graphs. Computer Systems Lab Google Scholar
- 11.Alivand M, Alesheikh AA, Malek MR (2008) New method for finding optimal path in dynamic networks. World Appl Sci J 3:25–33. 2008 Google Scholar
- 12.Bast H, Carlsson E, Eigenwillig A, Geisberger R, Harrelson Ch, Raychev V, Viger F (2008) Fast routing in very large public transportation networks using transfer patterns. In: ESA 2008, vol 1, pp 290–301 Google Scholar