1. Adjiashvili, D., Zenklusen, R.: An s - t connection problem with adaptability. Discrete Applied Mathematics 159(8), 695–705 (2011)
2. Lecture Notes in Computer Science;H. Aissi,2005
3. Andreatta, G., Romeo, L.: Stochastic shortest paths with recourse. Networks 18(3), 193–204 (1988)
4. Bar-Noy, A., Khuller, S., Schieber, B.: The complexity of finding most vital arcs and nodes. Technical report, Univ. of Maryland Institute for Advanced Computer Studies Report No. UMIACS-TR-95-96, College Park, MD, USA (1995)
5. Bar-Noy, A., Schieber, B.: The canadian traveller problem. In: SODA 1991, pp. 261–270. SIAM, Philadelphia (1991)