Swapping a failing edge of a single source shortest paths tree is good and fast

Algorithmica (New York)

Volumn 35, Issue 1, 2003, Pages 56-74

  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

Network survivability; Single source shortest paths tree; Swap algorithms

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER NETWORKS; GRAPH THEORY; OPTIMIZATION; SET THEORY; THEOREM PROVING;

NETWORK SURVIVABILITY; SINGLE SOURCE SHORTEST PATHS TREE; SWAP ALGORITHMS;

ALGORITHMS;

EID: 0942290176     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-002-0988-z     Document Type: Article

References (14)

1. B. Dixon, M. Rauch and R.E. Tarjan, Verification and sensitivity analysis of minimum spanning trees in linear time, SIAM J. Comput., 21(6) (1992), 1184-1192.
2. M.L. Fredman and R.E. Tarjan, Fibonacci heaps and their uses in improved network optimization algorithms, J. Assoc. Comput. Mach., 34(3) (1987), 596-615.
3. D. Frigioni, A. Marchetti-Spaccamela and U. Nanni, Fully dynamic output bounded single source shortest path problem, Proc. 7th ACM-SIAM Symposium on Discrete Algorithms (SODA '96), 1996, pp. 212-221.
4. M. Grötschel, C.L. Monma and M. Stoer, Design of survivable networks, Handbook in OR and MS, Vol. 7, Elsevier, Amsterdam, 1995, pp. 617-672.
5. F. Harary, Graph Theory, Addison-Wesley, Reading, MA, 1969.
6. D. Harel and R.E. Tarjan, Fast algorithms for finding nearest common ancestors, SIAM J. Comput., 13(2) (1984), 338-355.
7. G.F. Italiano and R. Ramaswami, Maintaining spanning trees of small diameter, Algorithmica, 22(3) (1998), 275-304.
8. K. Iwano and N. Katoh, Efficient algorithms for finding the most vital edge of a minimum spanning tree, Inform. Process. Lett., 48(5) (1993), 211-213.
9. E. Nardelli, G. Proietti and P. Widmayer, Finding all the best swaps of a minimum diameter spanning tree under transient edge failures, J. Graph Algorithms Appl., 5(5) (2001), 39-57.
10. E. Nardelli, G. Proietti and P. Widmayer, How to swap a failing edge of a single source shortest paths tree, Proc. 5th Annual International Computing and Combinatorics Conference (COCOON '99), Vol. 1627 of Lecture Notes in Computer Science, Springer-Verlag, Berlin, 1999, pp. 144-153.
11. R.E. Tarjan, Efficiency of a good but not linear set union algorithm, J. Assoc. Comput. Mach., 22 (1975), 215-225.
12. R.E. Tarjan, Complexity of monotone networks of computing conjunctions, Ann. Discrete Math., 2 (1975), 121-133.
13. R.E. Tarjan, Applications of path compression on balanced trees, J. Assoc. Comput. Mach., 26 (1979), 690-715.
14. R.E. Tarjan, Sensitivity analysis of minimum spanning trees and shortest path trees, Inform. Process. Lett., 14(1) (1982), 30-33.