Fault-Tolerant Approximate BFS Structures
From MaRDI portal
Publication:4554956
DOI10.1145/3022730zbMath1422.68193arXiv1406.6169OpenAlexW2784432858MaRDI QIDQ4554956
Publication date: 12 November 2018
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1406.6169
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 (6)
Improved Purely Additive Fault-Tolerant Spanners ⋮ Path-Fault-Tolerant Approximate Shortest-Path Trees ⋮ Mincut sensitivity data structures for the insertion of an edge ⋮ Blackout-tolerant temporal spanners ⋮ Fault tolerant approximate BFS structures with additive stretch ⋮ Multiple-edge-fault-tolerant approximate shortest-path trees
This page was built for publication: Fault-Tolerant Approximate BFS Structures