References

Balan, A.O. and L. Traldi, 2003. Preprocessing minpaths for sum of disjoint products. IEEE. Trans. Reliab., 52: 289-295.
CrossRef  |  Direct Link  |  

Chen, S.G., 2011. Search for all minimal paths in a general directed flow network with unreliable nodes. Intl. J. Reliab. Qual. Perform., 2: 63-70.

Chen, Y.G. and M.C. Yuang, 1996. A cut-based method for terminal-pair reliability. IEEE. Trans. Reliab., 45: 413-416.
CrossRef  |  Direct Link  |  

Colbourn, C.J. and C.J. Colbourn, 1987. The Combinatorics of Network Reliability. Vol. 200, Oxford University Press, New York, USA., Pages: 159.

Dash, R.K., N.K. Badapanda, P.K. Tripathy and C.R. Tripathy, 2012. Reliability optimization of interconnection network node edge failure model. Appl. Soft Comput., 12: 2322-2328.

Hardy, G., C. Lucet and N. Limnios, 2007. K-terminal network reliability measures with binary decision diagrams. IEEE. Trans. Reliab., 56: 506-515.
CrossRef  |  Direct Link  |  

Jane, C.C. and Y.W. Laih, 2008. A practical algorithm for computing multi-state two-terminal reliability. IEEE. Transac. Reliab., 57: 295-302.
CrossRef  |  Direct Link  |  

Jane, C.C. and Y.W. Laih, 2010. Computing multi-state two-terminal reliability through critical arc states that interrupt demand. IEEE. Trans. Reliab., 59: 338-345.
CrossRef  |  Direct Link  |  

Kuo, S.Y., F.M. Yeh and H.Y. Lin, 2007. Efficient and exact reliability evaluation for networks with imperfect vertices. IEEE. Trans. Reliab., 56: 288-300.
CrossRef  |  Direct Link  |  

Kuo, S.Y., S.K. Lu and F.M. Yeh, 1999. Determining terminal-pair reliability based on edge expansion diagrams using OBDD. IEEE. Trans. Reliab., 48: 234-246.
CrossRef  |  Direct Link  |  

Lin, Y.K. and P.C. Chang, 2011. Maintenance reliability estimation for a cloud computing network with nodes failure. Expert Syst. Appl., 38: 14185-14189.
Direct Link  |  

Lin, Y.K., 2002. Using minimal cuts to evaluate the system reliability of a stochastic-flow network with failures at nodes and arcs. Reliab. Eng. Syst. Saf., 75: 41-46.
Direct Link  |  

Nahman, J.M., 1994. Enumeration of mps of modified networks. Micro Electron. Reliab., 34: 475-484.

Rodionov, A., D. Migov and O. Rodionova, 2012. Improvements in the efficiency of cumulative updating of all-terminal network reliability. IEEE. Trans. Reliab., 61: 460-465.
CrossRef  |  Direct Link  |  

Sharafat, A.R. and O.R. Ma'rouzi, 2009. All-terminal network reliability using recursive truncation algorithm. IEEE. Trans. Reliab., 58: 338-347.
CrossRef  |  Direct Link  |  

Tripathy, P.K., R.K. Dash and C.R. Tripathy, 2013. A new genetic algorithm based method for topological optimization of interconnection networks. Intl. J. Comput. Appli., 63: 7-13.
Direct Link  |  

Tripathy, P.K., R.K. Dash and C.R. Tripathy, 2014. An efficient method based on self-generating disjoint minimal cut-sets for evaluating reliability measures of interconnection networks. Intl. J. Performability Eng., 10: 303-312.
Direct Link  |  

Tripathy, P.K., R.K. Dash and C.R. Tripathy, 2015. A dynamic programming approach for layout optimization of interconnection networks. Eng. Sci. Technol. Intl. J., 18: 374-384.
Direct Link  |  

Yan, Z. and M. Qian, 2007. Improving efficiency of solving MC problem in stochastic-flow network. Reliab. Eng. Syst. Saf., 92: 30-39.
CrossRef  |  Direct Link  |  

Yeh, W.C., 2007. A simple heuristic algorithm for generating all minimal paths. IEEE. Trans. Reliab., 56: 488-494.
CrossRef  |  Direct Link  |  

Yeh, W.C., 2008. A fast algorithm for searching all multi-state minimal cuts. IEEE. Trans. Reliab., 57: 581-588.
CrossRef  |  Direct Link  |  

Yeh, W.C., 2009. A simple universal generating function method to search for all minimal paths in networks. IEEE. Trans. Syst. Man Cybern. Part A. Syst. Humans, 39: 1247-1254.
CrossRef  |  Direct Link  |  

Zang, X., D. Wang, H. Sun and K.S. Trivedi, 2003. A BDD-based algorithm for analysis of multistate systems with multistate components. IEEE. Trans. Comput., 52: 1689-1691.
CrossRef  |  Direct Link  |