Improved algorithms for replacement paths problems in restricted graphs-Reference-Cited by-同舟云学术

Improved algorithms for replacement paths problems in restricted graphs

Published:2005-09 Issue:5 Volume:33 Page:459-466
ISSN:0167-6377
Container-title:Operations Research Letters
language:en
Short-container-title:Operations Research Letters

Author:

Bhosle Amit M.

Publisher

Elsevier BV

Subject

Applied Mathematics,Industrial and Manufacturing Engineering,Management Science and Operations Research,Software

Reference23 articles.

1. A. BarNoy, S. Khuller, B. Schieber, The complexity of finding most vital arcs and nodes, Technical Report CS-TR-3539, University of Maryland, Institute for Advanced Computer Studies, MD, 1995.

2. M. Bhosle, T.F. Gonzalez, Efficient algorithms for single link failure recovery and its application to atm networks, in: Proceedings of the 15th IASTED International Conference on PDCS, vol. 1, ACTA Press, 2003, pp. 87–92.

3. A linear algorithm for analysis of minimum spanning and shortest-path trees of planar graphs;Booth;Algorithmica,1994

4. A minimum spanning tree algorithm will inverse-ackermann type complexity;Chazelle;J. Assoc. Comput. Mach.,2000

5. A note on two problems in connection with graphs;Dijkstra;Numer. Math.,1959

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Algorithms and Lower Bounds for Replacement Paths under Multiple Edge Failure;2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS);2022-10

2. The gravity of an edge;Applied Network Science;2018-05-10

3. Replacement Paths via Row Minima of Concise Matrices;SIAM Journal on Discrete Mathematics;2014-01

4. Finding the Anti-block Vital Node of a Shortest Path;2009 International Conference on New Trends in Information and Service Science;2009-06

5. Finding the Optimal Shortest Path Tree with Respect to Single Link Failure Recovery;2008 Fourth International Conference on Networked Computing and Advanced Information Management;2008-09