Optimal-Size Strong Connectivity Preservers under Two Edge Failures in Subcubic Time
cs.DS
Submitted: 2026-11-12
Updated: 2026-11-12
Terminology
Sources
- Multiplying matrices via polynomials: exposition and barriers
- Strong Connectivity Oracle for Multiple Failures via Rooted Flow-Augmentation
- Dynamic Matrix Inverse: Improved Algorithms and Matching Conditional Lower Bounds
- New Extremal bounds for Reachability and Strong-Connectivity Preservers under failures
- Strong Connectivity in Directed Graphs under Failures, with Application
- Near-Optimal Fault-Tolerant Strong Connectivity Preservers
- Sensitive Distance and Reachability Oracles for Large Batch Updates
Related papers
- Exploiting Low Scanwidth to Resolve Soft Polytomies
- PHastR: Faster Minimal Perfect Hashing with Rotated Layouts
- Fine-Grained Complexity of Approximating Vector Knapsack: A Faster Algorithm and Equivalence with k-SUM in 2D
- Polynomial-time computation of p-contraction fixed points for even p
- Separations Between Submodular-Like Graph Widths
- Bounded Integer Programming in Almost N 2d Time