REFERENCES
- Aggarwal , K. K. , Chopra , Y. C. and Bajwa , J. S. 1982 . Capacity consideration in reliability analysis of communication systems . IEEE Trans. Reliability , 31 : 177 – 180 .
- Colbourn , C. J. 1987 . The Combinatorics of Network Reliability New York : Oxford University Press .
- Doulliez , P. and Jamoulle , E. 1972 . Transportation networks with random arc capacities . Revue Francaise d' Automatique, Informatique et Recherche Operationnelle , 2 : 45 – 59 .
- Ford , L. R. and Fulkerson , D. R. 1962 . Flows in Networks Princeton, New Jersey : Princeton University Press .
- Hu , T. C. 1982 . Combinatorial Algorithms Massachusetts : Addison-Wesley .
- Jane , C.-C. and Yuan , J. 2001 . A sum of disjoint products algorithm for reliability evaluation of flow networks . European Journal of Operational Research , 131 : 664 – 675 .
- Locks , M. O. 1982 . Recursive disjoint products: a review of three algorithm . IEEE Trans. Reliability , 31 : 33 – 35 .
- Provan , J. S. and Ball , M. O. 1984 . Computing network reliability in time polynomial in the number of cuts . Operations Research , 32 : 516 – 526 .
- Rai , S and Soh , S. 1991 . A computer approach for reliability evaluation of telecommunication networks with heterogeneous link-capacities . IEEE Trans. Reliability , 40 : 441 – 451 .
- Rueger , W. J. 1986 . Reliability analysis of networks with capacity constraints and failure at branches & nodes . IEEE Trans. Reliability , 35 : 523 – 528 .