Multiple source dual fault tolerant BFS trees

Let G = (V,E) be a graph with n vertices and m edges, with a designated set of σ sources S ⊆ V. The fault tolerant subgraph for any graph problem maintains a sparse subgraph H = (V,E′) of G with E′ ⊆ E, such that for any set F of k failures, the solution for the graph problem on G \ F is maintained in its subgraph H \ F. We address the problem of maintaining a fault tolerant subgraph for computing Breath First Search tree (BFS) of the graph from a single source s 2 V (referred as k FT-BFS) or multiple sources S ⊆ V (referred as κ FT-MBFS). We simply refer to them as FT-BFS (or FT-MBFS) for κ = 1, and dual FT-BFS (or dual FT-MBFS) for κ = 2. The problem of k FT-BFS was first studied by Parter and Peleg [ESA13]. They designed an algorithm to compute FT-BFS subgraph of size O(n^3/2). Further, they showed how their algorithm can be easily extended to FT-MBFS requiring O(σ1/2n^3/2) space. They also presented matching lower bounds for these results. The result was later extended to solve dual FT-BFS by Parter [PODC15] requiring O(n^5/3) space, again with matching lower bounds. However, their result was limited to only edge failures in undirected graphs and involved very complex analysis. Moreover, their solution doesn't seems to be directly extendible for dual FT-MBFS problem. We present a similar algorithm to solve dual FT-BFS problem with a much simpler analysis. Moreover, our algorithm also works for vertex failures and directed graphs, and can be easily extended to handle dual FT-MBFS problem, matching the lower bound of O(σ^1/3n^5/3) space described by Parter [PODC15]. The key difference in our approach is a much simpler classification of path interactions which formed the basis of the analysis by Parter [PODC15].