Finding the detour-critical edge of a shortest path between two nodes

Information Processing Letters

Volumn 67, Issue 1, 1998, Pages 51-54

  Nardelli, Enrico ^a,b   Proietti, Guido ^b,d   Widmayer, Peter ^c  

^a CNR   (Italy)

^b UNIVERSITY OF L'AQUILA   (Italy)

^c ETH ZURICH   (Switzerland)

^d Carnegie Mellon University ^*  (United States)

Author keywords

Fault tolerance; Longest detour; Most critical edge; Shortest path; Transient edge failures

Indexed keywords

COMPUTATIONAL COMPLEXITY; FAULT TOLERANT COMPUTER SYSTEMS; GRAPH THEORY; PROBLEM SOLVING;

DETOUR CRITICAL EDGE; TRANSIENT EDGE FAILURES;

CRITICAL PATH ANALYSIS;

EID: 0032117371     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(98)00077-5     Document Type: Article

References (3)

1. M.L. Fredman, R.E. Tarjan, Fibonacci heaps and their uses in improved network optimization algorithms, J. ACM 34 (3) (1987) 596-615.
2. K. Malik, A.K. Mittal, S.K. Gupta, The k most vital arcs in the shortest path problem, Oper. Res. Lett. 8 (1989) 223-227.
3. R.E. Tarjan, A note on finding the bridges of a graph, Inform. Process. Lett. 2 (1974) 160-161.