TRICONNECTED DECOMPOSITION FOR COMPUTING K-TERMINAL NETWORK RELIABILITY

被引：11
作者：
WOOD, RK
机构：
来源：
NETWORKS | 1989年 / 19卷 / 02期
关键词：
D O I：
10.1002/net.3230190203
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
引用
收藏
页码：203 / 220
页数：18
相关论文
共 20 条
[1]  
ADAM A, 1960, ACTA MATHE, V12, P377
[2]   NETWORK RELIABILITY-ANALYSIS USING 2-CONNECTED DIGRAPH REDUCTIONS [J].
AGRAWAL, A ;
SATYANARAYANA, A .
NETWORKS, 1985, 15 (02) :239-256
[3]   COMPLEXITY OF NETWORK RELIABILITY COMPUTATIONS [J].
BALL, MO .
NETWORKS, 1980, 10 (02) :153-165
[4]  
BALL MO, 1983, SIAM J COMPUT, V12, P777
[5]  
BIRNBAUM ZW, 1965, SIAM J APPL MATH, V13, P444
[6]   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
[7]  
CHANG MK, 1979, THESIS U CALIFORNIA
[8]   TOPOLOGY OF SERIES-PARALLEL NETWORKS [J].
DUFFIN, RJ .
JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS, 1965, 10 (02) :303-&
[9]  
Frank H., 1972, NETWORKS, V2, P135
[10]  
Haray F., 1969, GRAPH THEORY
12