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

DOI10.1016/j.jda.2013.08.001zbMath1334.05170OpenAlexW2071324569MaRDI QIDQ396686

Sanjeev Saxena, Jay Mahadeokar

Publication date: 13 August 2014

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2013.08.001

zbMATH Keywords

shortest pathdetour critical edgereplacement paths

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

A simple algorithm for replacement paths problem

Cites Work

• Unnamed Item
• Finding the detour-critical edge of a shortest path between two nodes
• The k most vital arcs in the shortest path problem
• Finding the most vital node of a shortest path.
• A faster computation of the most vital edge of a shortest path
• Applications of Path Compression on Balanced Trees
• Undirected single-source shortest paths with positive integer weights in linear time
• Floats, Integers, and Single Source Shortest Paths
• Optimal Doubly Logarithmic Parallel Algorithms Based On Finding All Nearest Smaller Values
• Finding the k shortest simple paths
• Faster shortest-path algorithms for planar graphs

This page was built for publication: Faster replacement paths algorithms in case of edge or node failure for undirected, positive integer weighted graphs