Partitions and network reliability

Discrete Applied Mathematics

Volumn 95, Issue 1-3, 1999, Pages 445-453

  Tittmann, Peter ^a  

^a Hochschule Mittweida   (Germany)

Author keywords

Network reliability; Reliability polynomial; Set partitions

Indexed keywords

EID: 0043280898     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(99)00092-X     Document Type: Article

References (7)

1. D. Bienstock, Some lattice theoretic tools for network reliability, Math. Oper. Res. 13 (1988) 467-478.
2. J.A. Buzacott, S.K. Chang, Cut set intersections and node partitions, IEEE Trans. Reliab. R-33 (1984) 385-389.
3. C.J. Colbourn, The Combinatorics of Network Reliability, Oxford University Press, New York, 1987.
4. P. Doubilet, On the foundations of combinatorial theory: VII. Symmetric functions through the theory of distribution and occupancy, Stud. Appl. Math. 51 (1972) 377-396.
5. V. Krishnamurthy, Combinatorics: Theory and applications, Ellis Horwood Limited, Chichester, 1986.
6. A. Rosenthal, Computing the reliability of complex networks, SIAM J. Appl. Math. 32 (1977) 384-393.
7. P. Tittmann, A. Blechschmidt, Reliability bounds based on network splitting, J. Inform. Process. Cybernet. EIK 27 (1991) 317-326.