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 条
  • [21] NP-hardness of the Euclidean Max-Cut problem
    Ageev, A. A.
    Kel'manov, A. V.
    Pyatkin, A. V.
    DOKLADY MATHEMATICS, 2014, 89 (03) : 343 - 345
  • [22] Max-Cut Problem Implementation and Analysis on a Quantum Computer
    Verghese, Ayaan
    Byron, David
    Amann, Andreas
    Popovici, Emanuel
    2022 33RD IRISH SIGNALS AND SYSTEMS CONFERENCE (ISSC), 2022,
  • [23] Solving the Max-Cut Problem using Semidefinite Optimization
    Orkia, Derkaoui
    Ahmed, Lehireche
    2016 4TH IEEE INTERNATIONAL COLLOQUIUM ON INFORMATION SCIENCE AND TECHNOLOGY (CIST), 2016, : 768 - 772
  • [24] NP-hardness of the Euclidean Max-Cut problem
    A. A. Ageev
    A. V. Kel’manov
    A. V. Pyatkin
    Doklady Mathematics, 2014, 89 : 343 - 345
  • [25] An ant colony algorithm for solving Max-cut problem
    Gao, Lin
    Zeng, Yan
    Dong, Anguo
    PROGRESS IN NATURAL SCIENCE-MATERIALS INTERNATIONAL, 2008, 18 (09) : 1173 - 1178
  • [26] A discrete dynamic convexized method for the max-cut problem
    Geng Lin
    Wenxing Zhu
    Annals of Operations Research, 2012, 196 : 371 - 390
  • [27] One-third-integrality in the max-cut problem
    Laurent, M
    Poljak, S
    MATHEMATICAL PROGRAMMING, 1995, 71 (01) : 29 - 50
  • [28] One-third-integrality in the max-cut problem
    Laurent, M.
    Poljak, S.
    Mathematical Programming, Series B, 1995, 71 (01): : 29 - 50
  • [29] A probabilistic result for the max-cut problem on random graphs
    Beck, A
    Teboulle, M
    OPERATIONS RESEARCH LETTERS, 2000, 27 (05) : 209 - 214
  • [30] Solving weighted max-cut problem by global equilibrium search
    Shylo, V.P.
    Shylo, O.V.
    Roschyn, V.A.
    Cybernetics and Systems Analysis, 2012, 48 (04) : 563 - 567
12345