A SURVEY OF NETWORK RELIABILITY AND DOMINATION THEORY

被引：95

作者：

AGRAWAL, A ^{[1
]}

BARLOW, RE ^{[1
]}

机构：

[1] UNIV CALIF BERKELEY,BERKELEY,CA 94720

来源：

OPERATIONS RESEARCH | 1984年 / 32卷 / 03期

关键词：

D O I：

10.1287/opre.32.3.478

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

The author present a brief survey of the current state of the art in network reliability. General methods are reviewed for network reliability computation and discuss the central role played by domination theory in network reliability computational complexity. The authors point out the connection with the more general problem of computing the reliability of coherent structures. The class of coherent structures contains both directed and undirected networks as well as logic (or fault) trees without not gates.

引用

页码：478 / 492

页数：15

共 26 条

[1] IMPROVED ALGORITHM FOR NETWORK RELIABILITY [J].

ABRAHAM, JA .

IEEE TRANSACTIONS ON RELIABILITY, 1979, 28 (01) :58-61

[2]

AGGARWAL KK, 1975, IEEE T RELIAB, VR 24, P83, DOI 10.1109/TR.1975.5215343

[3]

AGRAWAL A, 1983, ORC832 U CAL OP RES

[4]

Ball Michael O., 1977, THESIS CORNELL U

[5] COMPLEXITY OF NETWORK RELIABILITY COMPUTATIONS [J].

BALL, MO .

NETWORKS, 1980, 10 (02) :153-165

[6]

BARLOW RE, 1982, ORC821 U CAL OP RES

[7]

CHANG MKK, 1981, THESIS U CALIFORNIA

[8]

DEO N, 1974, GRAPH THEORY APPLICA

[9] 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

[10] FINDING ALL SPANNING TREES OF DIRECTED AND UN-DIRECTED GRAPHS [J].

GABOW, HN ;

MYERS, EW .

SIAM JOURNAL ON COMPUTING, 1978, 7 (03) :280-287

← 1 2 3 →