19 citations · 110 across the 50 of their papers we have counts for
1 paper · 2 filters
Merav Parter, David Peleg
This paper addresses the problem of designing a sparse {\em fault-tolerant} BFS tree, or {\em FT-BFS tree} for short, namely, a sparse subgraph T of the given network G such th…