An Inclusion-Exclusion Algorithm for Network Reliability with Minimal Cutsets

Show more

References

[1] C. J. Colbourn, “The Combinatorics of Network Reliability,” Oxford University Press, New York Oxford, 1987.

[2] M. O. Ball, C. J. Colbourn and J. S. Provan, “Network Reliability,” Handbook of Operations Research: Network Models, Elsevier North-Holland, Amsterdam, Vol. 7, 1995, pp. 673-762.

[3] J. A. Buzacott, “Node Partition Formula for Directed Graph Reliability,” Networks, Vol. 17, No. 2, 1987, pp. 227-240. doi:10.1002/net.3230170207

[4] J. A. Buzacott and S. K. Chang, “Cut Set Intersections and Node Partition,” IEEE Transactions on Reliability, Vol. 31, No. 4, 1982, pp. 385-389.

[5] A. Satyanarayana and A. Prabhakar, “New Topological Formula and Rapid Algorithm for Reliability Analysis of Complex Networks,” IEEE Transactions on Reliability, Vol. 27, No. 1, 1978, pp. 82-100.
doi:10.1109/TR.1978.5220266

[6] A. Satyanarayana and J. N. Hagstrom, “A New Algorithm for Reliability Analysis of Multi-Terminal Networks,” IEEE Transactions on Reliability, Vol. 30, No. 4, 1981, pp. 325-334. doi:10.1109/TR.1981.5221103

[7] L. C. Zhao and F. J. Kong, “A New Formula and an Algorithm for Reliability Analysis of Network,” Microelectron Reliability, Vol. 37, No. 4, 1997, pp. 511-518.

[8] W. C. Yeh, “A Greedy Branch-and-Bound Inclusion-Exclusion Algorithm for Calculating the Exact Multi-State Network Reliability,” IEEE Transactions on Reliability, Vol. 57, No. 1, 2008, pp. 88-93.
doi:10.1109/TR.2008.916871