Advertisement

Searching Shortest Paths on Weakly Dynamic Graphs

  • Jean-Yves ColinEmail author
  • Moustafa Nakechbandi
  • A. S. Ould Cheikh
Part of the Springer Proceedings in Complexity book series (SPCOM)

Abstract

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.

Keywords

Shortest paths Dynamic graphs Route planning 

References

  1. 1.
    Dijkstra EW (1959) A note on two problems in connexion with graphs. Numer Math 1:269–271 MathSciNetzbMATHCrossRefGoogle Scholar
  2. 2.
    Fulkerson D (1962) Expected critical path lengths in PERT networks. Oper Res 10:808–817 zbMATHCrossRefGoogle Scholar
  3. 3.
    Minoux M (1976) Structures algébriques généralisées des problèmes de cheminement dans les graphes: théorèmes, algorithmes et applications. RAIRO Rech Opér 10(6):33–62 MathSciNetzbMATHGoogle Scholar
  4. 4.
    Mirchandani PB, Soroush H (1985) Optimal paths in probabilistic networks. A case with temporary preferences. Comput Oper Res 12:365–383. 1985 MathSciNetzbMATHCrossRefGoogle Scholar
  5. 5.
    Orda A, Rom R (1990) Shortest-path and minimum-delay algorithms in networks with time dependent edgelength. J ACM 37(3):607–625. 1990 MathSciNetzbMATHCrossRefGoogle Scholar
  6. 6.
    Ramalingam G, Reps T (1996) On the computational complexity of dynamic graph problems. Theor Comput Sci 158:233–277. 1996 MathSciNetzbMATHCrossRefGoogle Scholar
  7. 7.
    Kuhn F, Oshman R (2011) Dynamic networks: models and algorithms. SIGACT News 42(1):82–96 CrossRefGoogle Scholar
  8. 8.
    Demetrescu C, Italiano GF (2004) A new approach to dynamic all pairs shortest paths. J ACM 51(6):968–992. 2004 MathSciNetzbMATHCrossRefGoogle Scholar
  9. 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. 10.
    Mao H (2008) Pathfinding algorithms for mutating graphs. Computer Systems Lab Google Scholar
  11. 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. 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

Copyright information

© Springer International Publishing Switzerland 2013

Authors and Affiliations

  • Jean-Yves Colin
    • 1
    Email author
  • Moustafa Nakechbandi
    • 1
  • A. S. Ould Cheikh
    • 2
  1. 1.LITISLe Havre UniversityLe Havre cedexFrance
  2. 2.Nouakchott UniversityNouakchottMauritania

Personalised recommendations