THE MAX-CUT PROBLEM ON GRAPHS NOT CONTRACTIBLE TO K5

被引：88

作者：

BARAHONA, F ^{[1
]}

机构：

[1] UNIV BONN,INST OPERAT RES,D-5300 BONN 1,FED REP GER

来源：

关键词：

D O I：

10.1016/0167-6377(83)90016-0

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：107 / 111

页数：5

共 20 条

[1]

ARAOZ J, 1982, 82238OR U BONN I OP

[2]

BACHEM A, 1982, MODERN APPLIED MATH, P51

[3] ON THE COMPUTATIONAL-COMPLEXITY OF ISING SPIN-GLASS MODELS [J].

BARAHONA, F .

JOURNAL OF PHYSICS A-MATHEMATICAL AND GENERAL, 1982, 15 (10) :3241-3253

[4]

BARAHONA F, 1982, FACETS BIPARTITE SUB

[5]

BARAHONA F, 1982, BALANCING SIGNED TOR

[6]

BARAHONA F, 1980, 186 U SCI MED GREN M

[7]

CORNUEJOLS G, 1982, TRAVELLING SALESMAN

[8] MAXIMUM MATCHING AND A POLYHEDRON WITH O'1-VERTICES [J].

EDMONDS, J .

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

[9]

Garey Michael R., 1979, COMPUTERS INTRACTABI

GROTSCHEL, M ;

LOVASZ, L ;

SCHRIJVER, A .