THE MAX-CUT PROBLEM ON GRAPHS NOT CONTRACTIBLE TO K5

被引：85
|
作者：
BARAHONA, F [1 ]
机构：
[1] UNIV BONN,INST OPERAT RES,D-5300 BONN 1,FED REP GER
来源：
OPERATIONS RESEARCH LETTERS | 1983年 / 2卷 / 03期
关键词：
D O I：
10.1016/0167-6377(83)90016-0
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
引用
收藏
页码：107 / 111
页数：5
相关论文
共 50 条
  • [1] A probabilistic result for the max-cut problem on random graphs
    Beck, A
    Teboulle, M
    [J]. OPERATIONS RESEARCH LETTERS, 2000, 27 (05) : 209 - 214
  • [2] Graphs with a small max-cut
    Delorme, C
    Favaron, O
    [J]. UTILITAS MATHEMATICA, 1999, 56 : 153 - 165
  • [3] MAX-CUT IN CIRCULANT GRAPHS
    POLJAK, S
    TURZIK, D
    [J]. DISCRETE MATHEMATICS, 1992, 108 (1-3) : 379 - 392
  • [4] On the max-cut of sparse random graphs
    Gamarnik, David
    Li, Quan
    [J]. RANDOM STRUCTURES & ALGORITHMS, 2018, 52 (02) : 219 - 262
  • [5] MAX-CUT on Samplings of Dense Graphs
    Fakcharoenphol, Jittat
    Vajanopath, Phanu
    [J]. 2022 19TH INTERNATIONAL JOINT CONFERENCE ON COMPUTER SCIENCE AND SOFTWARE ENGINEERING (JCSSE 2022), 2022,
  • [6] MAX-CUT and Containment Relations in Graphs
    Kaminski, Marcin
    [J]. GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2010, 6410 : 15 - 26
  • [7] MAX-CUT and containment relations in graphs
    Kaminski, Marcin
    [J]. THEORETICAL COMPUTER SCIENCE, 2012, 438 : 89 - 95
  • [8] EIGENVALUES AND THE MAX-CUT PROBLEM
    MOHAR, B
    POLJAK, S
    [J]. CZECHOSLOVAK MATHEMATICAL JOURNAL, 1990, 40 (02) : 343 - 352
  • [9] THE PERFORMANCE OF AN EIGENVALUE BOUND ON THE MAX-CUT PROBLEM IN SOME CLASSES OF GRAPHS
    DELORME, C
    POLJAK, S
    [J]. DISCRETE MATHEMATICS, 1993, 111 (1-3) : 145 - 156
  • [10] Sparsest cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem
    Mourad Baïou
    Francisco Barahona
    [J]. Mathematical Programming, 2018, 172 : 59 - 75
12345