A revised layered-network algorithm to search for all d-minpaths of a limited-flow acyclic network
- 1 January 1998
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Reliability
- Vol. 47 (4), 436-442
- https://doi.org/10.1109/24.756087
Abstract
No abstract availableThis publication has 17 references indexed in Scilit:
- On reliability evaluation of a capacitated‐flow network in terms of minimal pathsetsNetworks, 1995
- Some considerations on reliability theory and its applicationsReliability Engineering & System Safety, 1988
- Availability evaluation of oil/gas production and transportation systemsReliability Engineering, 1987
- A Monte Carlo Sampling Plan for Estimating Network ReliabilityOperations Research, 1986
- A Comparison of Four Monte Carlo Methods for Estimating the Probability of s-t ConnectednessIEEE Transactions on Reliability, 1986
- Reliability Evaluation of Multistate Systems with Multistate ComponentsIEEE Transactions on Reliability, 1985
- The Complexity of Counting Cuts and of Computing the Probability that a Graph is ConnectedSIAM Journal on Computing, 1983
- Reliability Evaluation of a Flow NetworkIEEE Transactions on Reliability, 1980
- The Complexity of Enumeration and Reliability ProblemsSIAM Journal on Computing, 1979
- Coherent Systems with Multi-State ComponentsMathematics of Operations Research, 1978