COMPUTATIONAL-COMPLEXITY OF NETWORK RELIABILITY-ANALYSIS - AN OVERVIEW

[1] NETWORK RELIABILITY-ANALYSIS USING 2-CONNECTED DIGRAPH REDUCTIONS [J]. NETWORKS, 1985, 15 (02) : 239 - 256

[2] Aho A. V., 1974, DESIGN ANAL COMPUTER, V1st

[3] Ball M. O., 1979, Mathematics of Operations Research, V4, P132, DOI 10.1287/moor.4.2.132

[4] Ball Michael O., 1977, THESIS CORNELL U

[5] COMPUTING NETWORK RELIABILITY [J]. OPERATIONS RESEARCH, 1979, 27 (04) : 823 - 838

[6] BOUNDS ON THE RELIABILITY POLYNOMIAL FOR SHELLABLE INDEPENDENCE SYSTEMS [J]. SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1982, 3 (02): : 166 - 181

[7] COMPLEXITY OF NETWORK RELIABILITY COMPUTATIONS [J]. NETWORKS, 1980, 10 (02) : 153 - 165

[8] CALCULATING BOUNDS ON REACHABILITY AND CONNECTEDNESS IN STOCHASTIC NETWORKS [J]. NETWORKS, 1983, 13 (02) : 253 - 278

[9] MULTI-COMPONENT SYSTEMS AND STRUCTURES AND THEIR RELIABILITY [J]. TECHNOMETRICS, 1961, 3 (01) : 55 - &

[10] BIXBY RE, 1975, NETWORKS, V5, P259

[1] NETWORK RELIABILITY-ANALYSIS USING 2-CONNECTED DIGRAPH REDUCTIONS [J]. NETWORKS, 1985, 15 (02) : 239 - 256

[2] Aho A. V., 1974, DESIGN ANAL COMPUTER, V1st

[3] Ball M. O., 1979, Mathematics of Operations Research, V4, P132, DOI 10.1287/moor.4.2.132

[4] Ball Michael O., 1977, THESIS CORNELL U

[5] COMPUTING NETWORK RELIABILITY [J]. OPERATIONS RESEARCH, 1979, 27 (04) : 823 - 838

[6] BOUNDS ON THE RELIABILITY POLYNOMIAL FOR SHELLABLE INDEPENDENCE SYSTEMS [J]. SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1982, 3 (02): : 166 - 181

[7] COMPLEXITY OF NETWORK RELIABILITY COMPUTATIONS [J]. NETWORKS, 1980, 10 (02) : 153 - 165

[8] CALCULATING BOUNDS ON REACHABILITY AND CONNECTEDNESS IN STOCHASTIC NETWORKS [J]. NETWORKS, 1983, 13 (02) : 253 - 278

[9] MULTI-COMPONENT SYSTEMS AND STRUCTURES AND THEIR RELIABILITY [J]. TECHNOMETRICS, 1961, 3 (01) : 55 - &

[10] BIXBY RE, 1975, NETWORKS, V5, P259