EDGE-CONNECTIVITY AUGMENTATION PROBLEMS

被引：154

作者：

WATANABE, T

NAKAMURA, A

机构：

来源：

关键词：

D O I：

10.1016/0022-0000(87)90038-9

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：96 / 144

页数：49

共 20 条

[1]

Aho A. V., 1974, DESIGN ANAL COMPUTER, V1st

[2]

Bollobas B., 1978, EXTREMAL GRAPH THEOR

[3]

Eswaran K. P., 1976, SIAM Journal on Computing, V5, P653, DOI 10.1137/0205044

[4]

Even S., 1979, GRAPH ALGORITHMS

[5] CONNECTIVITY CONSIDERATIONS IN DESIGN OF SURVIVABLE NETWORKS [J].

FRANK, H ;

CHOU, W .

IEEE TRANSACTIONS ON CIRCUIT THEORY, 1970, CT17 (04) :486-&

[6] APPROXIMATION ALGORITHMS FOR SEVERAL GRAPH AUGMENTATION PROBLEMS [J].

FREDERICKSON, GN ;

JAJA, J .

[7]

Garey M. R., 1978, COMPUTERS INTRACTABI

[8]

Harary F., 1969, GRAPH THEORY, DOI DOI 10.1201/9780429493768

[9]

Hu T.C., 1969, INTEGER PROGRAMMING

[10]

KAJITANI Y, 1983, CAS833 TECHN RES REP, P17