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] The rectilinear Steiner arborescence problem is NP-complete [J].

Shi, WP ;

Su, C .

SIAM JOURNAL ON COMPUTING, 2006, 35 (03) :729-740

[22] Generalized Shisen-Sho is NP-Complete [J].

Iwamoto, Chuzo ;

Wada, Yoshihiro ;

Morita, Kenichi .

IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2012, E95D (11) :2712-2715

[23] Autoreducibility of NP-Complete Sets [J].

Hitchcock, John M. ;

Shafei, Hadi .

33RD SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2016), 2016, 47

[24] A simplified NP-complete MAXSAT problem [J].

Raman, V ;

Ravikumar, B ;

Rao, SS .

INFORMATION PROCESSING LETTERS, 1998, 65 (01) :1-6

[25] Splitting NP-complete sets infinitely [J].

Zhang, Liyu ;

Quweider, Mahmoud ;

Khan, Fitra ;

Lei, Hansheng .

INFORMATION PROCESSING LETTERS, 2024, 186

[26] Column subset selection is NP-complete [J].

Shitov, Yaroslav .

LINEAR ALGEBRA AND ITS APPLICATIONS, 2021, 610 :52-58

[27] Finding smooth maps NP-complete [J].

Poland, J .

INFORMATION PROCESSING LETTERS, 2003, 85 (05) :249-253

[28] The transposition median problem is NP-complete [J].

Bader, Martin .

THEORETICAL COMPUTER SCIENCE, 2011, 412 (12-14) :1099-1110

[29] Sublinear P system solutions to NP-complete problems [J].

Dinneen, Michael J. ;

Henderson, Alec ;

Nicolescu, Radu .

THEORETICAL COMPUTER SCIENCE, 2023, 958

[30] An NP-complete fragment of fibring logic [J].

Wu, Yin ;

Jiang, Min ;

Huang, Zhongqiang ;

Chao, Fei ;

Zhou, Changle .

ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 2015, 75 (3-4) :391-417

← 1 2 3 4 5 →