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 条
  • [41] MAX-CUT IN CIRCULANT GRAPHS
    POLJAK, S
    TURZIK, D
    [J]. DISCRETE MATHEMATICS, 1992, 108 (1-3) : 379 - 392
  • [42] Sparsest cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem
    Baiou, Mourad
    Barahona, Francisco
    [J]. MATHEMATICAL PROGRAMMING, 2018, 172 (1-2) : 59 - 75
  • [43] 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
  • [44] Approximation algorithms for the Bi-criteria weighted MAX-CUT problem
    Angel, E
    Bampis, E
    Gourvès, L
    [J]. GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2005, 3787 : 331 - 340
  • [45] A comparison study of harmony search and genetic algorithm for the max-cut problem
    Kim, Yong-Hyuk
    Yoon, Yourim
    Geem, Zong Woo
    [J]. SWARM AND EVOLUTIONARY COMPUTATION, 2019, 44 : 130 - 135
  • [46] Hybridizing the cross-entropy method: An application to the max-cut problem
    Laguna, Manuel
    Duarte, Abraham
    Marti, Rafael
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2009, 36 (02) : 487 - 498
  • [47] 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
  • [48] Approximation algorithms for the bi-criteria weighted MAX-CUT problem
    Angel, Eric
    Bampis, Evripidis
    Gourves, Laurent
    [J]. DISCRETE APPLIED MATHEMATICS, 2006, 154 (12) : 1685 - 1692
  • [49] Sparsest Cut in Planar Graphs, Maximum Concurrent Flows and Their Connections with the Max-Cut Problem
    Baiou, Mourad
    Barahona, Francisco
    [J]. INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, IPCO 2016, 2016, 9682 : 63 - 76
  • [50] On the max-cut of sparse random graphs
    Gamarnik, David
    Li, Quan
    [J]. RANDOM STRUCTURES & ALGORITHMS, 2018, 52 (02) : 219 - 262
12345