Multiple Source Dual Fault Tolerant BFS Trees

DOI10.4230/LIPIcs.ICALP.2017.127zbMath1442.68174arXiv1704.06907OpenAlexW2963228239MaRDI QIDQ5111459

Manoj Gupta, Shahbaz Khan

Publication date: 27 May 2020

Full work available at URL: https://arxiv.org/abs/1704.06907

zbMATH Keywords

BFSdata structuresgraph algorithmsfault-tolerance

Mathematics Subject Classification ID

Analysis of algorithms (68W40) 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 (9)

Blackout-tolerant temporal spanners ⋮ Unnamed Item ⋮ An efficient strongly connected components algorithm in the fault tolerant model ⋮ Graph spanners: a tutorial review ⋮ Unnamed Item ⋮ Multiple-edge-fault-tolerant approximate shortest-path trees ⋮ 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: Multiple Source Dual Fault Tolerant BFS Trees