A decomposition algorithm for network reliability evaluation

Discrete Applied Mathematics

Volumn 65, Issue 1-3, 1996, Pages 141-156

  Carlier, Jacques ^a   Lucet, Corinne ^a  

^a UNIVERSITÉ DE TECHNOLOGIE DE COMPIÈGNE   (France)

Author keywords

Algorithm; Boundary set; Computer program; Factoring; Network decomposition; Network reliability; Reductions

Indexed keywords

EID: 0002667254     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0166-218X(95)00032-M     Document Type: Article

References (10)

1. S. Arnborg, Efficient algorithms for combinatorial problems on graphs with bounded decomposability - A survey, BIT 25 (1985) 2-23.
2. J.G. Carlier and O.R. Theologou, An efficient program for computing undirected network reliability, in: R. Avenhaus, H. Karkar and M. Rudnianski, eds., Defense Decision Making (Springer, Berlin, 1991) 3-13.
3. L. Page and J. Perry, A practical implementation of the factoring theorem for network reliability, IEEE Trans. Reliability 37 (1988) 259-267.
4. A. Rosenthal, Computing the reliability of complex networks, SIAM J. Appl. Math 32 (1977) 384-393.
5. A Satyanarayana and M. Chang, Network reliability and the factoring theorem, Networks, 1 (1983) 107-120.
6. A. Satyanarayana and R.K. Wood, A linear-time algorithm for computing K-terminal reliability in series parallel networks, SIAM J. Comput. 14 (1985) 818-832.
7. R. Tarjan, Dividing a graph into triconnected components, SIAM J. Comput. 2 (1973) 135-158.
8. O.R. Theologou, Contribution to network reliability evaluation, Ph. D Thesis, Department of Computer Science, Université de Technologie de Compiègne (1990) (in French).
9. O.R. Theologou and J.G. Carlier, Factoring and reductions for networks with imperfect vertices, IEEE Trans. Reliability 40 (1991) 210-217.
10. R.K. Wood, Triconnected decomposition for computing K-terminal network reliability, Networks 19 (1989) 203-220.