Similar Items: Low-Cost Arborescence Under Edge Faults
- Dynamic Edge Coloring of Forests
- Computing the (k+2)-Edge-Connected Components in k-Edge-Connected Digraphs in Subquadratic Time
- Undirected Replacement Paths: Dual Fault Reduces to Single Source
- Block Permutation Routing on Ramanujan Hypergraphs for Fault-Tolerant Quantum Computing
- Weighted Emulators with Local Heaviest Edges Stretch for Undirected Graphs
- An Approximation Algorithm for 2-Vertex-Connectivity via Cycle-Restricted 2-Edge-Covers