Fault Tolerant Approximate BFS Structures
From MaRDI portal
Publication:5384042
DOI10.1137/1.9781611973402.80zbMath1422.68194OpenAlexW2950113334MaRDI QIDQ5384042
Publication date: 20 June 2019
Published in: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1.9781611973402.80
Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items
Efficient Oracles and Routing Schemes for Replacement Paths ⋮ Fault tolerant approximate BFS structures with additive stretch ⋮ 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 ⋮ Unnamed Item
