An O(|E|) Time Algorithm for Computing the Reliability of a Class of Directed Networks
From MaRDI portal
Publication:3335483
DOI10.1287/opre.32.3.493zbMath0544.90033OpenAlexW2023059211MaRDI QIDQ3335483
No author found.
Publication date: 1984
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.32.3.493
polynomial time algorithmsdirected networksreliability-preserving reductionssource-to-terminal reliability
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Reliability, availability, maintenance, inspection in operations research (90B25)
Related Items (6)
Parametric max flow problems in a class of networks with series-parallel structure ⋮ Algebraic Methods Applied to Network Reliability Problems ⋮ Measuring the distance to series-parallelity by path expressions ⋮ A note on integral generalized flows in directed partial 2-trees ⋮ Reliable assignments of processors to tasks and factoring on matroids ⋮ Computation of the Reconstruction Probability of Secret Sharing Schemes based on the K-terminal Reliability
This page was built for publication: An O(|E|) Time Algorithm for Computing the Reliability of a Class of Directed Networks
