Replacement paths and k simple shortest paths in unweighted directed graphs

Lecture Notes in Computer Science

Volumn 3580, Issue , 2005, Pages 249-260

  Roditty, Liam ^a   Zwick, Uri ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; MATRIX ALGEBRA; MONTE CARLO METHODS; PROBLEM SOLVING;

NON-TRIVIAL ALGORITHMS; UNWEIGHTED DIRECTED GRAPHS;

GRAPH THEORY;

EID: 26444461209     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11523468_21     Document Type: Conference Paper

References (21)

1. S. Baswana, R. Hariharan, and S. Sen. Improved decremental algorithms for transitive closure and all-pairs shortest paths. In Proc. of 34th STOC, pages 117-123, 2002.
2. S. Baswana, R. Hariharan, and S. Sen. Maintaining all-pairs approximate shortest paths under deletion of edges. In Proc. of 14th SODA, pages 394-403, 2003.
3. C. Demetrescu and M. Thorup. Oracles for distances avoiding a link-failure. In Proc. of 13th SODA, pages 838-843, 2002.
4. C. Demetrescu, M. Thorup, R. Alam Chaudhury, and V. Ramachandran. Oracles for distances avoiding a link-failure.
5. D. Eppstein. Finding the k shortest paths. SIAM Journal on Computing, 28(2):652-673, 1998.
6. M. Henzinger and V. King. Fully dynamic biconnectivity and transitive closure. In Proc. of 36th FOCS, pages 664-672, 1995.
7. J. Hershberger and S. Suri. Vickrey prices and shortest paths: what is an edge worth? In Proc. of 42nd FOCS, pages 252-259, 2001.
8. J. Hershberger and S. Suri. Erratum to "vickrey pricing and shortest paths: What is an edge worth?". In Proc. of 43rd FOCS, page 809, 2002.
9. J. Hershberger, S. Suri, and A. Bhosle. On the difficulty of some shortest path problems. In Proc. of the 20th STACS, pages 343-354, 2003.
10. D.R. Karger, D. Koller, and S.J. Phillips. Finding the hidden path: time bounds for all-pairs shortest paths. SIAM Journal on Computing, 22:1199-1217, 1993.
11. N. Katoh, T. Ibaraki, and H. Mine. An efficient algorithm for K shortest simple paths. Networks, 12(4):411-427, 1982.
12. E.L. Lawler. A procedure for computing the K best solutions to discrete optimization problems and its application to the shortest path problem. Management Science, 18:401-405, 1971/72.
13. K. Malik, A. K. Mittal, and S. K. Gupta. The k most vital arcs in the shortest path problem. Operations Research Letters, 8(4):223-227, 1989.
14. E. Nardelli, G. Proietti, and P. Widmayer. A faster computation of the most vital edge of a shortest path. Information Processing Letters, 79(2):81-85, 2001.
15. N. Nisan and A. Ronen. Algorithmic mechanism design. Games and Economic Behavior, 35:166-196, 2001.
16. L. Roditty and U. Zwick. Dynamic approximate all-pairs shortest paths in undirected graphs. In Proc. of 45th FOCS, 2004. 499-508.
17. L. Roditty and U. Zwick. On dynamic shortest paths problems. In Proc. of 12th ESA, 2004. 580-591.
18. M. Thorup. Undirected single-source shortest paths with positive integer weights in linear time. Journal of the ACM, 46:362-394, 1999.
19. J.D. Ullman and M. Yannakakis. High-probability parallel transitive-closure algorithms. SIAM Journal on Computing, 20:100-125, 1991.
20. J.Y. Yen. Finding the K shortest loopless paths in a network. Management Science, 17:712-716, 1970/71.
21. U. Zwick. All-pairs shortest paths using bridging sets and rectangular matrix multiplication. Journal of the ACM, 49:289-317, 2002.