A RECURSIVE ALGORITHM FOR DIRECTED-GRAPH RELIABILITY

被引:8
作者
BUZACOTT, JA
机构
关键词
D O I
10.1002/net.3230130208
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:241 / 246
页数:6
相关论文
共 9 条
[1]   COMPUTING NETWORK RELIABILITY [J].
BALL, MO .
OPERATIONS RESEARCH, 1979, 27 (04) :823-838
[2]   COMPLEXITY OF NETWORK RELIABILITY COMPUTATIONS [J].
BALL, MO .
NETWORKS, 1980, 10 (02) :153-165
[3]   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
[4]  
BUZACOTT JA, 1981, UNPUB NODE PARTITION
[5]   BOOLEAN-ALGEBRA METHOD FOR COMPUTING TERMINAL RELIABILITY IN A COMMUNICATION NETWORK [J].
FRATTA, L ;
MONTANARI, UG .
IEEE TRANSACTIONS ON CIRCUIT THEORY, 1973, CT20 (03) :203-211
[6]  
MURCHLAND TD, 1975, RELIABILITY FAULT TR
[7]   COMBINATORIAL PROPERTIES OF DIRECTED-GRAPHS USEFUL IN COMPUTING NETWORK RELIABILITY [J].
SATYANARAYANA, A ;
HAGSTROM, JN .
NETWORKS, 1981, 11 (04) :357-366
[8]   NEW TOPOLOGICAL FORMULA AND RAPID ALGORITHM FOR RELIABILITY ANALYSIS OF COMPLEX NETWORKS [J].
SATYANARAYANA, A ;
PRABHAKAR, A .
IEEE TRANSACTIONS ON RELIABILITY, 1978, 27 (02) :82-100
[9]   DECOMPOSITION ALGORITHM FOR NETWORK RELIABILITY ANALYSIS [J].
SHOGAN, AW .
NETWORKS, 1978, 8 (03) :231-251