TY  - JOUR
EP  - 155
VL  - 4
JF  - Journal of Artificial Intelligence
A1  - Qureshi, M.A.
A1  - Hassan, M.F.
A1  - Sammi, R.
A1  - Safdar, S.
A1  - Akbar, R.
UR  - https://www.scopus.com/inward/record.uri?eid=2-s2.0-80055048797&doi=10.3923%2fjai.2011.143.155&partnerID=40&md5=4e122b38f76b8458d475a46cb9400841
SN  - 19945450
Y1  - 2011///
SP  - 143
TI  - Shortest path tree with embedded backups - An exhaustive link failure recovery algorithm
ID  - scholars1839
N2  - In many applications like robot navigation, games, transportation and communication routing, shortest path plays an important role. In such applications vigorous and proficient recovery is vital. Planning for the recovery from failure with minimum additional healing cost, as well as no or least delay is desired. This study presents an algorithm to construct a tree that has all possible recovery plans embedded in it. © 2011 Asian Network for Scientific Information.
IS  - 2
N1  - cited By 0
AV  - none
ER  -