Deterministic Replacement Path Covering
Deterministic Replacement Path Covering
In this article, we provide a unified and simplified approach to derandomize central results in the area of fault-tolerant graph algorithms. Given a graph G, a vertex pair (s, t) ∊ V(G) × V(G), and a set of edge faults F ⊆ E(G), a replacement path P(s, t, F) is …