A POLYNOMIAL ALGORITHM FOR MAXIMUM WEIGHTED VERTEX PACKINGS ON GRAPHS WITHOUT LONG ODD CYCLES

被引：20

作者：

HSU, WL ^{[1
]}

IKURA, Y ^{[1
]}

NEMHAUSER, GL ^{[1
]}

机构：

[1] CORNELL UNIV, ITHACA, NY 14853 USA

来源：

关键词：

D O I：

10.1007/BF01589347

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

页码：225 / 232

页数：8

共 13 条

[1]

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

[2] PATHS TREES AND FLOWERS [J].

EDMONDS, J .

CANADIAN JOURNAL OF MATHEMATICS, 1965, 17 (03) :449-&

[3]

Ford L. R., 1962, FLOWS NETWORKS

[4]

Fulkerson D. R., 1972, J COMBIN THEORY B, V12, P50

[5]

Garey M. R., 1976, Theoretical Computer Science, V1, P237, DOI 10.1016/0304-3975(76)90059-1

[6]

Gavril F., 1972, SIAM Journal on Computing, V1, P180, DOI 10.1137/0201013

[7]

Harary F., 1969, GRAPH THEORY, DOI DOI 10.21236/AD0705364

[8]

Hopcroft J. E., 1973, SIAM Journal on Computing, V2, P225, DOI 10.1137/0202019

[9]

HSU WL, 1980, THESIS CORNELL U

[10]

Karzanov A. V, 1974, SOV MATH DOKL, V15, P434