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 条
  • [21] Recognition of polygon-circle graphs and graphs of interval filaments is NP-complete
    Pergel, Martin
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2007, 4769 : 238 - +
  • [22] Rikudo is NP-complete
    Viet-Ha Nguyen
    Perrot, Kevin
    THEORETICAL COMPUTER SCIENCE, 2022, 910 : 34 - 47
  • [23] Minesweeper is NP-complete
    Kaye, R
    MATHEMATICAL INTELLIGENCER, 2000, 22 (02): : 9 - 15
  • [24] BLOCKSUM is NP-Complete
    Haraguchi, Kazuya
    Ono, Hirotaka
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2013, E96D (03) : 481 - 488
  • [25] Tipover is NP-complete
    Robert A. Hearn
    The Mathematical Intelligencer, 2006, 28 : 10 - 14
  • [26] HIROIMONO is NP-Complete
    Andersson, Daniel
    Fun with Algorithms, Proceedings, 2007, 4475 : 30 - 39
  • [27] TETRAVEX is NP-complete
    Takenaga, Yasuhiko
    Walsh, Toby
    INFORMATION PROCESSING LETTERS, 2006, 99 (05) : 171 - 174
  • [28] Optimal sequentialization of gated data dependence graphs is NP-complete
    Upton, E
    PDPTA'03: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS 1-4, 2003, : 1767 - 1770
  • [29] THE EDGE HAMILTONIAN PATH PROBLEM IS NP-COMPLETE FOR BIPARTITE GRAPHS
    LAI, TH
    WEI, SS
    INFORMATION PROCESSING LETTERS, 1993, 46 (01) : 21 - 26
  • [30] TipOver is NP-complete
    Hearn, Robert A.
    MATHEMATICAL INTELLIGENCER, 2006, 28 (03): : 10 - 14
12345