Computational complexity of coherent systems and the reliability polynomial

Probability in the Engineering and Informational Sciences

Volumn 2, Issue 4, 1988, Pages 461-469

  Iyer, S ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b INDIAN STATISTICAL INSTITUTE   (India)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; POLYNOMIALS; TREES (MATHEMATICS);

COHERENT SYSTEM; EFFICIENT STRATEGY; GENERAL METHOD; INCLUSION-EXCLUSION; MINIMAL PATH; RELIABILITY POLYNOMIALS; SYSTEM RELIABILITY EVALUATION; UNDIRECTED NETWORK;

RELIABILITY THEORY;

EID: 84974486883     PISSN: 02699648     EISSN: 14698951     Source Type: Journal    
DOI: 10.1017/S0269964800000164     Document Type: Article

References (5)

1. Barlow, R.E. & Agrawal, A. (1984). A survey of network reliability and domination theory. Operations Research 32: 478–492.
2. Barlow, R.E. & Heidtmann, K.D. (1985). k-out-of-n structure reliability. IEEE Transactions on Reliability R-33: 322–323.
3. Huseby, A.B. (1984): A unified theory of domination and signed domination with application to exact reliability computation. Statistical Research Report, Institute of Mathematics, University of Oslo, Norway.
4. Lehman, A. (1964). A solution of the Shannon switching game. Journal for the Society of Industrial and Applied Mathematics 12: 687–725.
5. Satyanarayana, A. & Chang, M.K. (1983). Network reliability and the factoring theorem. Networks 13: 107–120.