COMPUTATIONAL-COMPLEXITY OF NETWORK RELIABILITY-ANALYSIS - AN OVERVIEW

被引:294
作者
BALL, MO
机构
关键词
D O I
10.1109/TR.1986.4335422
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:230 / 239
页数:10
相关论文
共 40 条
[1]   NETWORK RELIABILITY-ANALYSIS USING 2-CONNECTED DIGRAPH REDUCTIONS [J].
AGRAWAL, A ;
SATYANARAYANA, A .
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].
BALL, MO .
OPERATIONS RESEARCH, 1979, 27 (04) :823-838
[6]   BOUNDS ON THE RELIABILITY POLYNOMIAL FOR SHELLABLE INDEPENDENCE SYSTEMS [J].
BALL, MO ;
PROVAN, JS .
SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1982, 3 (02) :166-181
[7]   COMPLEXITY OF NETWORK RELIABILITY COMPUTATIONS [J].
BALL, MO .
NETWORKS, 1980, 10 (02) :153-165
[8]   CALCULATING BOUNDS ON REACHABILITY AND CONNECTEDNESS IN STOCHASTIC NETWORKS [J].
BALL, MO ;
PROVAN, JS .
NETWORKS, 1983, 13 (02) :253-278
[9]   MULTI-COMPONENT SYSTEMS AND STRUCTURES AND THEIR RELIABILITY [J].
BIRNBAUM, ZW ;
ESARY, JD ;
SAUNDERS, SC .
TECHNOMETRICS, 1961, 3 (01) :55-&
[10]  
BIXBY RE, 1975, NETWORKS, V5, P259