MaxCut on permutation graphs is NP-complete

被引：0
|
作者：
de Figueiredo, Celina M. H. [1 ]
de Melo, Alexsander A. [1 ]
Oliveira, Fabiano S. [2 ]
Silva, Ana [3 ]
机构：
[1] Fed Univ Rio Janeiro, COPPE, Rio De Janeiro, Brazil
[2] Rio Janeiro State Univ, IME, Rio De Janeiro, Brazil
[3] Univ Fed Ceara, Dept Math, Fortaleza, CE, Brazil
来源：
JOURNAL OF GRAPH THEORY | 2023年 / 104卷 / 01期
关键词：
computational complexity; maximum cut; NP-complete; permutation graphs;
D O I：
10.1002/jgt.22948
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
The decision problem MaxCut is known to be NP-complete since the seventies, but only recently its restriction to interval graphs has been announced to be hard by Adhikary, Bose, Mukherjee, and Roy. Building on their proof, in this paper we prove that the MaxCut problem is NP-complete on permutation graphs. This settles a long-standing open problem that appeared in the 1985 column of the Ongoing Guide to NP-completeness by David S. Johnson, and is the first NP-hardness entry for permutation graphs in such column.
引用
收藏
页码：5 / 16
页数：12
相关论文
共 50 条
  • [31] BoxOff is NP-Complete
    Hayward, Ryan
    Hearn, Robert
    Jamshidian, Mahya
    ADVANCES IN COMPUTER GAMES, ACG 2021, 2022, 13262 : 118 - 127
  • [32] Identification Conditions for the Solvability of NP-Complete Problems for the Class of Prefractal Graphs
    Tymoshenko, A. V.
    Kochkarov, R. A.
    Kochkarov, A. A.
    AUTOMATIC CONTROL AND COMPUTER SCIENCES, 2022, 56 (07) : 807 - 814
  • [33] Identification Conditions for the Solvability of NP-Complete Problems for the Class of Prefractal Graphs
    A. V. Tymoshenko
    R. A. Kochkarov
    A. A. Kochkarov
    Automatic Control and Computer Sciences, 2022, 56 : 807 - 814
  • [34] Maximum Cut on Interval Graphs of Interval Count Four is NP-Complete
    de Figueiredo, Celina M. H.
    de Melo, Alexsander A.
    Oliveira, Fabiano S.
    Silva, Ana
    DISCRETE & COMPUTATIONAL GEOMETRY, 2024, 71 (03) : 893 - 917
  • [35] Partitioning to three matchings of given size is NP-complete for bipartite graphs
    Palvolgyi, Domotor
    ACTA UNIVERSITATIS SAPIENTIAE INFORMATICA, 2014, 6 (02) : 206 - 209
  • [36] Maximum Cut on Interval Graphs of Interval Count Four is NP-Complete
    Celina M. H. de Figueiredo
    Alexsander A. de Melo
    Fabiano S. Oliveira
    Ana Silva
    Discrete & Computational Geometry, 2024, 71 : 893 - 917
  • [37] Tree Convex Bipartite Graphs: NP-Complete Domination, Hamiltonicity and Treewidth
    Wang, Chaoyi
    Chen, Hao
    Lei, Zihan
    Tang, Ziyang
    Liu, Tian
    Xu, Ke
    FRONTIERS IN ALGORITHMICS, FAW 2014, 2014, 8497 : 252 - 263
  • [38] Contextual reasoning is NP-complete
    Massacci, F
    PROCEEDINGS OF THE THIRTEENTH NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE, VOLS 1 AND 2, 1996, : 621 - 626
  • [39] Calculation Solitaire is NP-Complete
    Iwamoto, Chuzo
    Ide, Tatsuya
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2023, E106D (03) : 328 - 332
  • [40] TENSOR RANK IS NP-COMPLETE
    HASTAD, J
    JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 1990, 11 (04): : 644 - 654
12345