EDGE-PACKINGS OF GRAPHS AND NETWORK RELIABILITY

被引：28

作者：

COLBOURN, CJ

机构：

来源：

DISCRETE MATHEMATICS | 1988年 / 72卷 / 1-3期

关键词：

D O I：

10.1016/0012-365X(88)90193-8

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

引用

页码：49 / 61

页数：13

共 24 条

[1] BOUNDS ON THE RELIABILITY POLYNOMIAL FOR SHELLABLE INDEPENDENCE SYSTEMS [J].

BALL, MO ;

PROVAN, JS .

SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1982, 3 (02) :166-181

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

BALL, MO .

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

[3] CALCULATING BOUNDS ON REACHABILITY AND CONNECTEDNESS IN STOCHASTIC NETWORKS [J].

BALL, MO ;

PROVAN, JS .

NETWORKS, 1983, 13 (02) :253-278

[4] IMPROVING RELIABILITY BOUNDS IN COMPUTER-NETWORKS [J].

BRECHT, TB ;

COLBOURN, CJ .

NETWORKS, 1986, 16 (04) :369-380

[5]

BRECHT TB, IN PRESS DISCRETE AP

[6]

Colbourn Ch.J., 1987, COMBINATORICS NETWOR

[7] BOUNDING ALL-TERMINAL RELIABILITY IN COMPUTER-NETWORKS [J].

COLBOURN, CJ ;

HARMS, DD .

NETWORKS, 1988, 18 (01) :1-12

[8] MINIMUM PARTITION OF A MATROID INTO INDEPENDENT SUBSETS [J].

EDMONDS, J .

JOURNAL OF RESEARCH OF THE NATIONAL BUREAU OF STANDARDS SECTION B-MATHEMATICS AND MATHEMATICAL, 1965, B 69 (1-2) :67-+

[9]

Fulkerson D., 1971, MATH PROGRAM, V1, P168

[10]

FULKERSON DR, 1968, MATH DECISION SCI 1, P303

← 1 2 3 →