Graphs with a small max-cut

被引：0
|
作者：
Delorme, C
Favaron, O
机构：
来源：
UTILITAS MATHEMATICA | 1999年 / 56卷
关键词：
D O I：
暂无
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
In this paper, we characterize the connected graphs whose maxcut is at most the order.
引用
收藏
页码：153 / 165
页数：13
相关论文
共 50 条
  • [41] LOWER BOUNDS FOR MAX-CUT IN H-FREE GRAPHS VIA SEMIDEFINITE PROGRAMMING
    Carlson, Charles
    Kolla, Alexandra
    Li, Ray
    Mani, Nitya
    Sudakov, Benny
    Trevisan, Luca
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2021, 35 (03) : 1557 - 1568
  • [42] Distributed Selfish Algorithms for the Max-Cut Game
    Auger, D.
    Cohen, J.
    Coucheney, P.
    Rodier, L.
    [J]. INFORMATION SCIENCES AND SYSTEMS 2013, 2013, 264 : 45 - 54
  • [43] A hierarchical social metaheuristic for the Max-Cut problem
    Duarte, A
    Fernández, F
    Sánchez, A
    Sanz, A
    [J]. EVOLUTIONARY COMPUTATION IN COMBINATORIAL OPTIMIZATION, PROCEEDINGS, 2004, 3004 : 84 - 94
  • [44] Cutting plane algorithm for the max-cut problem
    de Simone, C.
    Rinaldi, G.
    [J]. Optimization Methods and Software, 1994, 3 (1-3) : 195 - 214
  • [45] Combinatorial persistency criteria for multicut and max-cut
    Lange, Jan-Hendrik
    Andres, Bjoern
    Swoboda, Paul
    [J]. 2019 IEEE/CVF CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR 2019), 2019, : 6086 - 6095
  • [46] An efficient Lagrangian smoothing heuristic for Max-Cut
    Yong Xia
    Zi Xu
    [J]. Indian Journal of Pure and Applied Mathematics, 2010, 41 : 683 - 700
  • [47] Partial Lasserre relaxation for sparse Max-Cut
    Campos, Juan S.
    Misener, Ruth
    Parpas, Panos
    [J]. OPTIMIZATION AND ENGINEERING, 2023, 24 (03) : 1983 - 2004
  • [48] Local Max-Cut in Smoothed Polynomial Time
    Angel, Omer
    Bubeck, Sebastien
    Peres, Yuval
    Wei, Fan
    [J]. STOC'17: PROCEEDINGS OF THE 49TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING, 2017, : 429 - 437
  • [49] ALGORITHMS FOR A CLASS OF MIN-CUT AND MAX-CUT PROBLEM
    GONZALEZ, TF
    MURAYAMA, T
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1992, 650 : 97 - 105
  • [50] Partial Lasserre relaxation for sparse Max-Cut
    Juan S. Campos
    Ruth Misener
    Panos Parpas
    [J]. Optimization and Engineering, 2023, 24 : 1983 - 2004
12345