Fault-Tolerant Approximate Shortest-Path Trees
From MaRDI portal
Publication:2921400
DOI10.1007/978-3-662-44777-2_12zbMath1422.68181OpenAlexW2568458273MaRDI QIDQ2921400
Stefano Leucci, Guido Proietti, Luciano Gualà, Davide Bilò
Publication date: 8 October 2014
Published in: Algorithms - ESA 2014 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-44777-2_12
Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Data structures (68P05) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items
Improved Purely Additive Fault-Tolerant Spanners ⋮ Path-Fault-Tolerant Approximate Shortest-Path Trees ⋮ Efficient Oracles and Routing Schemes for Replacement Paths ⋮ Vertex fault tolerant additive spanners ⋮ Fault-Tolerant Subgraph for Single-Source Reachability: General and Optimal ⋮ Sparse Weight Tolerant Subgraph for Single Source Shortest Path ⋮ Unnamed Item