COMPUTATIONAL-COMPLEXITY OF NETWORK RELIABILITY-ANALYSIS - AN OVERVIEW

[21] KERSHENBAUM A, 1973, NETWORKS, V3, P81

[22] KIRHHOFF G, 1958, IRE T CIRCUIT THEORY, V5, P4

[23] ANALYSIS OF SWITCHING NETWORKS [J]. BELL SYSTEM TECHNICAL JOURNAL, 1955, 34 (06): : 1287 - 1315

[24] MOGHTADERIZADEH M, 1981, UNPUB SEISMIC RELIAB

[25] Moore E.F., 1956, J FRANKL INST, V262, P191

[26] MOORE EF, 1959, ANN COMPUTATION LABO, V30, P285

[27] POLITOF T, 1984, ORC844 U CAL OP RES

[28] THE COMPLEXITY OF COUNTING CUTS AND OF COMPUTING THE PROBABILITY THAT A GRAPH IS CONNECTED [J]. SIAM JOURNAL ON COMPUTING, 1983, 12 (04) : 777 - 788

[29] COMPUTING NETWORK RELIABILITY IN TIME POLYNOMIAL IN THE NUMBER OF CUTS [J]. OPERATIONS RESEARCH, 1984, 32 (03) : 516 - 526

[30] PROVAN JS, 1983, UNCORSAJR8312 U N CA

[21] KERSHENBAUM A, 1973, NETWORKS, V3, P81

[22] KIRHHOFF G, 1958, IRE T CIRCUIT THEORY, V5, P4

[23] ANALYSIS OF SWITCHING NETWORKS [J]. BELL SYSTEM TECHNICAL JOURNAL, 1955, 34 (06): : 1287 - 1315

[24] MOGHTADERIZADEH M, 1981, UNPUB SEISMIC RELIAB

[25] Moore E.F., 1956, J FRANKL INST, V262, P191

[26] MOORE EF, 1959, ANN COMPUTATION LABO, V30, P285

[27] POLITOF T, 1984, ORC844 U CAL OP RES

[28] THE COMPLEXITY OF COUNTING CUTS AND OF COMPUTING THE PROBABILITY THAT A GRAPH IS CONNECTED [J]. SIAM JOURNAL ON COMPUTING, 1983, 12 (04) : 777 - 788

[29] COMPUTING NETWORK RELIABILITY IN TIME POLYNOMIAL IN THE NUMBER OF CUTS [J]. OPERATIONS RESEARCH, 1984, 32 (03) : 516 - 526

[30] PROVAN JS, 1983, UNCORSAJR8312 U N CA