MAX-CUT and containment relations in graphs

被引：10
|
作者：
Kaminski, Marcin [1 ]
机构：
[1] Univ Libre Brussels, Dept Informat, Brussels, Belgium
来源：
THEORETICAL COMPUTER SCIENCE | 2012年 / 438卷
关键词：
MAX-CUT; Subgraph; Induced subgraph; Minor; WEAKLY BIPARTITE GRAPHS; SINGLE-CROSSING GRAPHS; BOUNDARY CLASSES; MAXIMUM CUT; SET PROBLEM; NP-HARD; MINORS; APPROXIMATION; ALGORITHMS; FOREST;
D O I：
10.1016/j.tcs.2012.02.036
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We study MAX-CUT in classes of graphs defined by forbidding finitely many graphs as subgraphs, or a single graph as an induced subgraph or a minor. For the first two containment relations, we prove dichotomy theorems. For the minor order, we show how to solve MAX-CUT in polynomial time for the class obtained by forbidding a graph with a single crossing (this generalizes a known result for K-5-minor-free graphs) and identify an open problem which is the missing case for a dichotomy theorem. (C) 2012 Elsevier B.V. All rights reserved.
引用
收藏
页码：89 / 95
页数：7
相关论文
共 50 条
  • [1] MAX-CUT and Containment Relations in Graphs
    Kaminski, Marcin
    [J]. GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2010, 6410 : 15 - 26
  • [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] An exact algorithm for MAX-CUT in sparse graphs
    Della Croce, F.
    Kaminski, M. J.
    Paschos, V. Th.
    [J]. OPERATIONS RESEARCH LETTERS, 2007, 35 (03) : 403 - 408
  • [7] Improved approximation of Max-Cut on graphs of bounded degree
    Feige, U
    Karpinski, M
    Langberg, M
    [J]. JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 2002, 43 (02): : 201 - 219
  • [8] Intractability of min- and max-cut in streaming graphs
    Zelke, Mariano
    [J]. INFORMATION PROCESSING LETTERS, 2011, 111 (03) : 145 - 150
  • [9] A probabilistic result for the max-cut problem on random graphs
    Beck, A
    Teboulle, M
    [J]. OPERATIONS RESEARCH LETTERS, 2000, 27 (05) : 209 - 214
  • [10] Max-cut and extendability of matchings in distance-regular graphs
    Cioaba, Sebastian M.
    Koolen, Jack
    Li, Weiqiang
    [J]. EUROPEAN JOURNAL OF COMBINATORICS, 2017, 62 : 232 - 244
12345