THE PERFECTLY MATCHABLE SUBGRAPH POLYTOPE OF A BIPARTITE GRAPH

被引：60

作者：

BALAS, E ^{[1
]}

PULLEYBLANK, W ^{[1
]}

机构：

[1] UNIV WATERLOO, FAC MATH, DEPT COMBINATOR & OPTIMIZAT, WATERLOO N2L 3G1, ONTARIO, CANADA

来源：

关键词：

D O I：

10.1002/net.3230130405

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：495 / 516

页数：22

共 13 条

[1]

BENDERS JF, 1962, NUMER MATH, V4, P238, DOI [10.1007/BF01386316, DOI 10.1007/BF01386316, DOI 10.1007/S10287-004-0020-Y]

[2] TRANSVERSALS AND MATROID PARTITION [J].

EDMONDS, J ;

FULKERSO.DR .

JOURNAL OF RESEARCH OF THE NATIONAL BUREAU OF STANDARDS SECTION B-MATHEMATICAL SCIENCES, 1965, B 69 (03) :147-+

[3]

EDMONDS J, 1979, ANN DISCRETE MATH, V4, P39

[4]

Edmonds J., 1971, MATH PROGRAM, V1, P127, DOI [10.1007/BF01584082, DOI 10.1007/BF01584082]

[5]

Edmonds J., 1975, ANN DISCRETE MATH, V1, P185

[6]

GROFLIN H, 1982, ANN DISCRETE MATH, V15, P239

[7]

GROTSCHEL M, 1977, POLYEDRISCHE CHARAKT

[8]

Hall P., 1935, J LONDON MATH SOC, V1, P26, DOI DOI 10.1112/JLMS/S1-10.37.26

[9]

Hoffman A., 1974, MATH PROGRAMMING SER, V6, P352

[10]

HOFFMAN AJ, 1978, MATH PROGRAM STUD, V8, P197, DOI 10.1007/BFb0121202