Sparse Fault-Tolerant BFS Trees
From MaRDI portal
Publication:2849365
DOI10.1007/978-3-642-40450-4_66zbMath1376.68113arXiv1302.5401OpenAlexW2103027585MaRDI QIDQ2849365
Publication date: 17 September 2013
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1302.5401
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items (13)
Improved Purely Additive Fault-Tolerant Spanners ⋮ Efficient Oracles and Routing Schemes for Replacement Paths ⋮ Vertex fault tolerant additive spanners ⋮ Reachability Preservers: New Extremal Bounds and Approximation Algorithms ⋮ Unnamed Item ⋮ Fault-Tolerant Subgraph for Single-Source Reachability: General and Optimal ⋮ An efficient strongly connected components algorithm in the fault tolerant model ⋮ Graph spanners: a tutorial review ⋮ Fault-tolerant approximate shortest-path trees ⋮ Connectivity Oracles for Graphs Subject to Vertex Failures ⋮ Sparse Weight Tolerant Subgraph for Single Source Shortest Path ⋮ Output sensitive fault tolerant maximum matching ⋮ New Results on Linear Size Distance Preservers
This page was built for publication: Sparse Fault-Tolerant BFS Trees
