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

Finding the Most Vital Node of a Shortest Path

COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics

Finding All the Best Swaps of a Minimum Diameter Spanning Tree under Transient Edge Failures

ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms

Finding the most vital node of a shortest path

Theoretical Computer Science - Computing and combinatorics

Finding the anti-block vital edge of a shortest path between two nodes

COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications

Real time critical edge of the shortest path in transportation networks

TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation

Faster replacement paths algorithms in case of edge or node failure for undirected, positive integer weighted graphs

Journal of Discrete Algorithms

Faster algorithm to find anti-risk path between two nodes of an undirected graph

Journal of Combinatorial Optimization