A faster computation of the most vital edge of a shortest path

Information Processing Letters

Volumn 79, Issue 2, 2001, Pages 81-85

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

^a UNIVERSITY OF L'AQUILA   (Italy)

^b CNR   (Italy)

^c ETH ZURICH   (Switzerland)

Author keywords

Graph algorithms; Most vital edge; Replacement shortest path; Shortest path; Transient failure

Indexed keywords

COMPUTATIONAL COMPLEXITY; FUNCTIONS; INVERSE PROBLEMS; PROBLEM SOLVING; RESPONSE TIME (COMPUTER SYSTEMS);

ACKERMANN FUNCTIONS; GRAPH ALGORITHMS; REPLACEMENT SHORTEST PATH;

ALGORITHMS;

EID: 0035973428     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(00)00175-7     Document Type: Article

References (7)

1. Malik K., Mittal A.K., Gupta S.K. The k most vital arcs in the shortest path problem. Oper. Res. Lett. 8:1989;223-227.
2. Nardelli E., Proietti G., Widmayer P. Finding the detour-critical edge of a shortest path between two nodes. Inform. Process. Lett. 67:(1):1998;51-54.
3. Tarjan R.E. A note on finding the bridges of a graph. Inform. Process. Lett. 2:1974;160-161.
4. Tarjan R.E. Efficiency of a good but not linear set union algorithm. J. ACM. 22:1975;215-225.
5. Tarjan R.E. Complexity of monotone networks of computing conjunctions. Ann. Discrete Math. 2:1975;121-133.
6. Tarjan R.E. Applications of path compression on balanced trees. J. ACM. 26:1979;690-715.
7. Thorup M. Floats, integers, and single source shortest paths. Proc. 15th Annual Symposium on Theoretical Aspects of Computer Science (STACS'98), Paris, France, February 25-27. Lecture Notes in Comput. Sci. 1373:1998;14-24 Springer, Berlin.