CALCULATING BOUNDS ON REACHABILITY AND CONNECTEDNESS IN STOCHASTIC NETWORKS

被引:89
作者
BALL, MO [1 ]
PROVAN, JS [1 ]
机构
[1] NBS,CTR APPL MATH,WASHINGTON,DC 20234
关键词
D O I
10.1002/net.3230130210
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:253 / 278
页数:26
相关论文
共 32 条
[1]  
Aho A. V., 1974, DESIGN ANAL COMPUTER, V1st
[2]  
[Anonymous], 1956, J FRANKL INST
[3]  
Ball Michael O., 1977, THESIS CORNELL U
[4]   COMPUTING NETWORK RELIABILITY [J].
BALL, MO .
OPERATIONS RESEARCH, 1979, 27 (04) :823-838
[5]   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
[6]   COMPLEXITY OF NETWORK RELIABILITY COMPUTATIONS [J].
BALL, MO .
NETWORKS, 1980, 10 (02) :153-165
[7]  
BIXBY RE, 1975, NETWORKS, V5, P259
[8]   A RECURSIVE ALGORITHM FOR FINDING RELIABILITY-MEASURES RELATED TO THE CONNECTION OF NODES IN A GRAPH [J].
BUZACOTT, JA .
NETWORKS, 1980, 10 (04) :311-327
[9]  
Edmonds J., 1972, COMBINATORIAL ALGORI, P91
[10]  
Even S., 1975, SIAM Journal on Computing, V4, P507, DOI 10.1137/0204043