Minimum+1 ( s, t )-cuts and Dual-edge Sensitivity Oracle

Mincut Sensitivity Data Structures for the Insertion of an Edge

(2022) Surender Baswana et al.   ALGORITHMICA

Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees

(2021) Davide Bilò et al.   ALGORITHMICA

Incremental Exact Min-Cut in Polylogarithmic Amortized Update Time

(2018) Gramoz Goranci et al.   ACM Transactions on Algorithms

An Efficient Strongly Connected Components Algorithm in the Fault Tolerant Model

(2018) Surender Baswana et al.   ALGORITHMICA

Fault-Tolerant Subgraph for Single-Source Reachability: General and Optimal

(2018) Surender Baswana et al.   SIAM JOURNAL ON COMPUTING

Deterministic Edge Connectivity in Near-Linear Time

(2018) Ken-Ichi Kawarabayashi et al.   JOURNAL OF THE ACM

Sparse Fault-Tolerant BFS Structures

(2016) Merav Parter et al.   ACM Transactions on Algorithms

Unifying the Landscape of Cell-Probe Lower Bounds

(2011) Mihai Ptraşcu   SIAM JOURNAL ON COMPUTING

Fault Tolerant Spanners for General Graphs

(2010) S. Chechik et al.   SIAM JOURNAL ON COMPUTING

Oracles for Distances Avoiding a Failed Node or Link

(2008) Camil Demetrescu et al.   SIAM JOURNAL ON COMPUTING