AN O(N.LOG(N)) ALGORITHM TO COMPUTE THE ALL-TERMINAL RELIABILITY OF (K(5), K(2),2,2) FREE NETWORKS

被引：6

作者：

POLITOF, T

SATYANARAYANA, A

TUNG, L

机构：

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

[2] STEVENS INST TECHNOL,INST DESIGN & MFG,HOBOKEN,NJ 07030

来源：

IEEE TRANSACTIONS ON RELIABILITY | 1992年 / 41卷 / 04期

关键词：

NETWORK RELIABILITY; K5 AND K2,2,2 FREE GRAPH; PARTIAL; 3-TREE; Y-DELTA GRAPH; ALGORITHM;

D O I：

10.1109/24.249577

中图分类号：

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

学科分类号：

0812 ;

摘要：

A graph is (K5, K2,2,2) free if it has no subgraph contractible to K5 or K2,2,2. The class of partial 3-trees (also known as Y-DELTA graphs) is a proper subset of (K5, K2,2,2) free graphs. Let G be a network with perfectly reliable points and edges that fail independently with some known probabilities. The all-terminal reliability R(G) of G is the probability that G is connected. Computing R(G) for a general network is NP-hard. This paper presents an O(n.log(n)) algorithm to compute R(G) of any (K5, K2,2,2) free graphs on n points. The running time of this algorithm is O(n) if G is planar.

引用

页码：512 / 517

页数：6

共 50 条

[1] An O(k2 • log (n)) algorithm for computing the reliability of consecutive-k-out-of-n:F systems
Lin, MS
IEEE TRANSACTIONS ON RELIABILITY, 2004, 53 (01) : 3 - 6
[2] AN O(N-CENTER-DOT(LOG(2)(N))(2)) ALGORITHM FOR COMPUTING THE RELIABILITY OF K-OUT-OF-N-G AND K-TO-L-OUT-OF-N-G SYSTEMS
BELFORE, LA
IEEE TRANSACTIONS ON RELIABILITY, 1995, 44 (01) : 132 - 136
[3] N, P, K - OR N, P2O5, K2O
不详
JOURNAL OF AGRICULTURAL AND FOOD CHEMISTRY, 1957, 5 (02) : 152 - 152
[4] An O(n) algorithm to compute the reliability of consecutive k-out-of-r-fcom-n :F system under the condition of r < 2k
Higashiyama, Yoichi
Cai, Xu
Rumchev, Ventsi
WMSCI 2010: 14TH WORLD MULTI-CONFERENCE ON SYSTEMICS, CYBERNETICS AND INFORMATICS, VOL I, 2010, : 151 - 154
[5] (2,2′-bipyridine-k2N,N′)bis(4-methylbenzoato-k2O,O′)zinc(II)
Shao, Yan-Qiu
ACTA CRYSTALLOGRAPHICA SECTION E-STRUCTURE REPORTS ONLINE, 2008, 64 : M655 - U414
[6] Pentaaqua-1K2O,2K3O-bis(2,2′-bipyridine)-1K2N,N′;2K2N,N′-μ-biphenyl-2,2′-dicarboxylato-1:2K2O:O′-biphenyl-2,2′-dicarboxylato-1KO-dimanganese(II) tetrahydrate
Du, Lin
Fang, Rui-Bing
Zhao, Qi-Hua
ACTA CRYSTALLOGRAPHICA SECTION E-STRUCTURE REPORTS ONLINE, 2007, 63 : M1439 - M1441
[7] An O(n(3) log log n/log(2) n) time algorithm for all pairs shortest paths
Han, Yijie
Takaoka, Tadao
JOURNAL OF DISCRETE ALGORITHMS, 2016, 38-41 : 9 - 19
[8] Aqua(2,2'-bipyridine-k(2)N,N'){(E)-[(5-chloro-2-oxidobenzylidene)amino-k(2) N, O] methanesulfonato-kO}zinc
Deng, Yi-Fang
Nie, Xue
Zhang, Chun-Hua
ACTA CRYSTALLOGRAPHICA SECTION E-CRYSTALLOGRAPHIC COMMUNICATIONS, 2012, 68 : M517 - +
[9] K2,2-K1,n and K2,n-K2,n bipartite Ramsey numbers
Carnielli, WA
Carmelo, ELM
DISCRETE MATHEMATICS, 2000, 223 (1-3) : 83 - 92
[10] DERIVATION OF AN O(K2LOG N) ALGORITHM FOR COMPUTING ORDER-K FIBONACCI NUMBERS FROM THE O(K3LOG N) MATRIX MULTIPLICATION METHOD
PETTOROSSI, A
INFORMATION PROCESSING LETTERS, 1980, 11 (4-5) : 172 - 179

← 1 2 3 4 5 →