NETWORK RELIABILITY-ANALYSIS USING 2-CONNECTED DIGRAPH REDUCTIONS

被引：14

作者：

AGRAWAL, A

SATYANARAYANA, A

机构：

[1] STEVENS INST TECHNOL,DEPT COMP SCI,HOBOKEN,NJ 07030

[2] UNIV CALIF BERKELEY,BERKELEY,CA 94720

来源：

关键词：

D O I：

10.1002/net.3230150209

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：239 / 256

页数：18

共 14 条

[1] AN O(ABSOLUTE VALUE E) TIME ALGORITHM FOR COMPUTING THE RELIABILITY OF A CLASS OF DIRECTED NETWORKS
AGRAWAL, A
SATYANARAYANA, A
[J]. OPERATIONS RESEARCH, 1984, 32 (03) : 493 - 515
[2] AGRAWAL A, 1983, ORC832 U CAL OP RES
[3] COMPLEXITY OF NETWORK RELIABILITY COMPUTATIONS
BALL, MO
[J]. NETWORKS, 1980, 10 (02) : 153 - 165
[4] Barlow R.E., 1975, RELIABILITY FAULT TR, P581
[5] BIRNBAUM ZW, 1965, SIAM J APPL MATH, V13, P444
[6] BONDY JA, 1976, GRAPH THEORY APPLICA
[7] HAGSTROM JN, 1980, THESIS U CALIFORNIA
[8] Rosenthal A., 1975, RELIABILITY FAULT TR, P133
[9] A UNIFIED FORMULA FOR ANALYSIS OF SOME NETWORK RELIABILITY PROBLEMS
SATYANARAYANA, A
[J]. IEEE TRANSACTIONS ON RELIABILITY, 1982, 31 (01) : 23 - 32
[10] NETWORK RELIABILITY AND THE FACTORING THEOREM
SATYANARAYANA, A
CHANG, MK
[J]. NETWORKS, 1983, 13 (01) : 107 - 120