This paper presents criteria for acceptable schemes to approximate system reliability and Investigates such schemes for a special clas of network reliability problems. In this framework, we are able to use powerful combinatorial theory to obtain strong bounds for network reliability which can be computed by efficient algorithms. We demonstrate these bounds on a small example, and give some computational experience.
No takes yet. Share an insight, caveat, or question.
J. Scott Provan (1987) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: