Replacement paths and k simple shortest paths in unweighted directed graphs

DOI10.1145/2344422.2344423zbMath1295.05237OpenAlexW2073094163MaRDI QIDQ3189075

Uri Zwick, Liam Roditty

Publication date: 9 September 2014

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2344422.2344423

zbMATH Keywords

shortest pathsgraph algorithms

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20) Randomized algorithms (68W20)

Related Items (8)

On the Power of Tree-Depth for Fully Polynomial FPT Algorithms ⋮ Subcubic Equivalences between Graph Centrality Problems, APSP, and Diameter ⋮ Vertex fault tolerant additive spanners ⋮ Unnamed Item ⋮ Compact distance oracles with large sensitivity and low stretch ⋮ Deterministic Combinatorial Replacement Paths and Distance Sensitivity Oracles ⋮ Sparse Weight Tolerant Subgraph for Single Source Shortest Path ⋮ Unnamed Item

This page was built for publication: Replacement paths and k simple shortest paths in unweighted directed graphs