Network reliability analysis using 2‐connected digraph reductions
- 1 June 1985
- Vol. 15 (2) , 239-256
- https://doi.org/10.1002/net.3230150209
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- An O(|E|) Time Algorithm for Computing the Reliability of a Class of Directed NetworksOperations Research, 1984
- Network reliability and the factoring theoremNetworks, 1983
- The Recognition of Series Parallel DigraphsSIAM Journal on Computing, 1982
- A Unified Formula for Analysis of Some Network Reliability ProblemsIEEE Transactions on Reliability, 1982
- Polygon-to-Chain Reductions and Network Reliability.Published by Defense Technical Information Center (DTIC) ,1982
- Complexity of network reliability computationsNetworks, 1980
- The Complexity of Enumeration and Reliability ProblemsSIAM Journal on Computing, 1979
- A fast algorithm for reliability calculations in sparse networksNetworks, 1977
- Graph Theory with ApplicationsPublished by Springer Nature ,1976
- Modules of Coherent Binary SystemsJournal of the Society for Industrial and Applied Mathematics, 1965