A NOTE ON LINE DIGRAPHS AND THE DIRECTED MAX-CUT PROBLEM

被引：8
|
作者：
CHVATAL, V [1 ]
EBENEGGER, C [1 ]
机构：
[1] UNIV GENEVA,EAUG,CH-1200 GENEVA,SWITZERLAND
来源：
DISCRETE APPLIED MATHEMATICS | 1990年 / 29卷 / 2-3期
关键词：
D O I：
10.1016/0166-218X(90)90141-X
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
The support of a digraph is the undirected graph arising when directions of edges are ignored. We prove that recognizing supports of line digraphs of digraphs is an NP-Complete problem. Then we observe that solvable cases of the directed max-cut problem arise from solvable cases of the maximum-weight stable set problem via supports of line digraphs; in particular, we investigate digraphs G such that the support of the line digraph of G is perfect. © 1990.
引用
收藏
页码：165 / 170
页数：6
相关论文
共 50 条
  • [31] THE EXPECTED RELATIVE ERROR OF THE POLYHEDRAL APPROXIMATION OF THE MAX-CUT PROBLEM
    POLJAK, S
    TUZA, Z
    OPERATIONS RESEARCH LETTERS, 1994, 16 (04) : 191 - 198
  • [32] On the Power of Nodes of Degree Four in the Local Max-Cut Problem
    Monien, Burkhard
    Tscheuschner, Tobias
    ALGORITHMS AND COMPLEXITY, PROCEEDINGS, 2010, 6078 : 264 - 275
  • [33] A New Global Algorithm for Max-Cut Problem with Chordal Sparsity
    Cheng Lu
    Zhibin Deng
    Shu-Cherng Fang
    Wenxun Xing
    Journal of Optimization Theory and Applications, 2023, 197 : 608 - 638
  • [34] An Integrated Method Based on PSO and EDA for the Max-Cut Problem
    Lin, Geng
    Guan, Jian
    COMPUTATIONAL INTELLIGENCE AND NEUROSCIENCE, 2016, 2016
  • [35] A New Global Algorithm for Max-Cut Problem with Chordal Sparsity
    Lu, Cheng
    Deng, Zhibin
    Fang, Shu-Cherng
    Xing, Wenxun
    JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2023, 197 (02) : 608 - 638
  • [36] Generalised 2-circulant inequalities for the max-cut problem
    Kaparis, Konstantinos
    Letchford, Adam N.
    Mourtos, Ioannis
    OPERATIONS RESEARCH LETTERS, 2022, 50 (02) : 122 - 128
  • [37] On the power of nodes of degree four in the local max-cut problem
    Faculty of Computer Science, Electrical Engineering, and Mathematics, University of Paderborn, Fürstenallee 11, Paderborn
    33102, Germany
    Lect. Notes Comput. Sci., (264-275):
  • [38] THE MAX-CUT PROBLEM ON GRAPHS NOT CONTRACTIBLE TO K5
    BARAHONA, F
    OPERATIONS RESEARCH LETTERS, 1983, 2 (03) : 107 - 111
  • [39] Graphs with a small max-cut
    Delorme, C
    Favaron, O
    UTILITAS MATHEMATICA, 1999, 56 : 153 - 165
  • [40] MAX-CUT IN CIRCULANT GRAPHS
    POLJAK, S
    TURZIK, D
    DISCRETE MATHEMATICS, 1992, 108 (1-3) : 379 - 392
12345