THE COMPLEXITY OF COUNTING CUTS AND OF COMPUTING THE PROBABILITY THAT A GRAPH IS CONNECTED

被引：474

作者：

PROVAN, JS ^{[1
]}

BALL, MO ^{[1
]}

机构：

[1] UNIV MARYLAND, COLL BUSINESS & MANAGEMENT, COLLEGE PK, MD 20742 USA

来源：

关键词：

D O I：

10.1137/0212053

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：777 / 788

页数：12

共 12 条

[1] BOUNDS ON THE RELIABILITY POLYNOMIAL FOR SHELLABLE INDEPENDENCE SYSTEMS
BALL, MO
PROVAN, JS
[J]. SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1982, 3 (02): : 166 - 181
[2] COMPLEXITY OF NETWORK RELIABILITY COMPUTATIONS
BALL, MO
[J]. NETWORKS, 1980, 10 (02) : 153 - 165
[3] CALCULATING BOUNDS ON REACHABILITY AND CONNECTEDNESS IN STOCHASTIC NETWORKS
BALL, MO
PROVAN, JS
[J]. NETWORKS, 1983, 13 (02) : 253 - 278
[4] Galil Z., 1974, SIGACT NEWS, V6, P19
[5] Garey Michael R., 1979, COMPUTERS INTRACTABI
[6] HAGSTROM JN, 1981, UNPUB COMPUTING ROOT
[7] Hardy G. H., 1952, MATH GAZ
[8] Householder AS, 1953, PRINCIPLES NUMERICAL
[9] JERRUM M, 1981, CST1181 U ED DEP COM
[10] KIRCHHOFF G, 1847, POGGENDORF ANN PHYS, V72, P497