Bibliography

Inclusion Exclusion(2-Terminal)

Buzacott, J. A. (1987). Node Partition Formula for Directed Graph Reliability. Networks, 17, pp.227–240.

Buzacott, J. A., & Chang, J. S. K. (Dec 1984). Cut- Set Intersections and Node Partitions. IEEE Transactions on Reliability, R-33(5), pp.385–389.

Kim, Y. H., Case, K. E., & Ghare, P. M. (1972). A Method for Computing Complex System Reliability. IEEE Transactions on Reliability, R-21, pp.215–219.

Lin, P. M., Leon, B. J., & Huang, T. C. (1976). A New Algorithm for Symbolic System Reliability Analysis. IEEE Transactions of Reliability, R-25.

Locks, M. O. (Dec 1985). Recent Developments in Computing of System Reliability. IEEE Transactions on Reliability, R-34(N5), pp.425–435.

Inclusion Exclusion(g-Terminal)

Buzacott, J. A. (1987). Node Partition Formula for Directed Graph Reliability. Networks, 17, pp. 227–240.

Buzacott, J. A., & Chang, J. S. K. (Dec 1984). Cut- Set Intersections and Node Partitions. IEEE Transactions on Reliability, R-33(5), pp.385–389.

Calculation of Bounds(2-Terminal)

Beichelt, F., & Spross, L. (1989). Bounds on the Reliability of Binary Coherent Systems. IEEE Transactions on Reliability, Vol. 38(4), pp.425–427.

Brecht, T. B., & Colbourn, C. J. (1986). Improving Reliability Bounds in Computer Networks. Networks, Vol.16, pp.369–380.

Hsieh, Y. C. (Sep 2003). New Reliability Bounds for Coherent Systems. Journal of the Operational Research Society, Vol. 54(9, Part Special Issue: Modelling Organizational Knowledge), pp. ...

Get Network Reliability now with O’Reilly online learning.

O’Reilly members experience live online training, plus books, videos, and digital content from 200+ publishers.