Partial factoring: an efficient algorithm for approximating two-terminal reliability on complete graphs
Authors:
- 1 January 1990
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Reliability
- Vol. 39 (3) , 290-295
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Network Reliability and Inner-Four-Cycle-Free GraphsMathematics of Operations Research, 1986
- A Linear-Time Algorithm for Computing K-Terminal Reliability in Series-Parallel NetworksSIAM Journal on Computing, 1985
- Network reliability analysis using 2‐connected digraph reductionsNetworks, 1985
- An O(|E|) Time Algorithm for Computing the Reliability of a Class of Directed NetworksOperations Research, 1984
- Network reliability and the factoring theoremNetworks, 1983
- Complexity of network reliability computationsNetworks, 1980
- Sequential Destruction Method for Monte Carlo Evaluation of System ReliabilityIEEE Transactions on Reliability, 1980
- Efficient Evaluation of System Reliability by Monte Carlo MethodIEEE Transactions on Reliability, 1977
- Transformations for simplifying network reliability calculationsNetworks, 1977
- Backtracking Algorithms for Network Reliability Analysis1977