Network Unreliability in Almost-Linear Time
Open Access
- 15 June 2025
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 120-131
Abstract
No abstract availableAll Related Versions
Funding Information
- NSF (National Science Foundation) (1955703,2329230)
This publication has 17 references indexed in Scilit:
- Beyond the Quadratic Time Barrier for Network Unreliability2024
- A Deterministic Almost-Linear Time Algorithm for Minimum-Cost Flow2023
- All-Pairs Max-Flow is no Harder than Single-Pair Max-Flow: Gomory-Hu Trees in Almost-Linear Time2023
- Tight bounds for popping algorithmsRandom Structures & Algorithms, 2020
- A Polynomial-Time Approximation Algorithm for All-Terminal Network ReliabilitySIAM Journal on Computing, 2019
- Faster (and Still Pretty Simple) Unbiased Estimators for Network (Un)reliability2017
- Improved bounds and algorithms for graph cuts and network reliabilityRandom Structures & Algorithms, 2017
- A Fast and Simple Unbiased Estimator for Network (Un)reliability2016
- The Complexity of Enumeration and Reliability ProblemsSIAM Journal on Computing, 1979
- Multi-Terminal Network FlowsJournal of the Society for Industrial and Applied Mathematics, 1961