MAXIMIZING THE MEAN NUMBER OF COMMUNICATING VERTEX PAIRS IN SERIES-PARALLEL NETWORKS

被引：12
作者：
CLARK, BN
NEUFELD, EM
COLBOURN, CJ
机构：
来源：
IEEE TRANSACTIONS ON RELIABILITY | 1986年 / 35卷 / 03期
关键词：
D O I：
10.1109/TR.1986.4335425
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
引用
收藏
页码：247 / 250
页数：4
相关论文
共 16 条
[1]   COMPLEXITY OF NETWORK RELIABILITY COMPUTATIONS [J].
BALL, MO .
NETWORKS, 1980, 10 (02) :153-165
[2]   TOPOLOGY OF SERIES-PARALLEL NETWORKS [J].
DUFFIN, RJ .
JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS, 1965, 10 (02) :303-&
[3]   NETWORKS IMMUNE TO ISOLATED FAILURES [J].
FARLEY, AM .
NETWORKS, 1981, 11 (03) :255-268
[4]  
Hilton A. J. W., 1974, FIBONACCI QUART, V12, P259
[5]   THE MOST RELIABLE SERIES-PARALLEL NETWORKS [J].
NEUFELD, EM ;
COLBOURN, CJ .
NETWORKS, 1985, 15 (01) :27-32
[6]  
NEUFELD EM, 1984, CONGRESSUS NUMERANTI, V41, P21
[7]  
NEUFELD EM, UNPUB CONGRESSUS NUM
[8]  
NEUFELD EM, UNPUB FIBONACCI Q
[9]   THE COMPLEXITY OF COUNTING CUTS AND OF COMPUTING THE PROBABILITY THAT A GRAPH IS CONNECTED [J].
PROVAN, JS ;
BALL, MO .
SIAM JOURNAL ON COMPUTING, 1983, 12 (04) :777-788
[10]  
SLATER PJ, 1977, FIBONACCI QUART, V15, P11
12