BOUNDING ALL-TERMINAL RELIABILITY IN COMPUTER-NETWORKS

被引:23
作者
COLBOURN, CJ [1 ]
HARMS, DD [1 ]
机构
[1] UNIV SASKATCHEWAN, DEPT COMPUTAT SCI, SASKATOON S7N 0W0, SASKATCHEWAN, CANADA
关键词
D O I
10.1002/net.3230180102
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:1 / 12
页数:12
相关论文
共 33 条
[1]  
[Anonymous], 1956, J FRANKL INST
[2]  
ASSOUS JY, 1984, BOUNDS TERMINAL RELI
[3]  
Ball M., 1977, ANN DISCRETE MATH, P49
[4]   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
[5]   CALCULATING BOUNDS ON REACHABILITY AND CONNECTEDNESS IN STOCHASTIC NETWORKS [J].
BALL, MO ;
PROVAN, JS .
NETWORKS, 1983, 13 (02) :253-278
[6]  
BOESCH FT, 1983, EECS8303 STEV I TECH
[7]  
Brooks R. L., 1940, DUKE MATH J, V7, P312, DOI 10.1215/S0012-7094-40-00718-9
[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]  
CARRASCO EH, 1985, RELIABILITY BOUNDS N
[10]  
Chvatal V., 1983, LINEAR PROGRAMMING