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 条

[41] Timed protocol insecurity problem is NP-complete [J].

Benerecetti, Massimo ;

Peron, Adriano .

FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2013, 29 (03) :843-862

[42] Broadcasting with the least energy is an NP-complete problem [J].

Yang, Wuu ;

Tseng, Huei-Ru ;

Jan, Rong-Hong ;

Shen, Bor-Yeh .

MUE: 2008 INTERNATIONAL CONFERENCE ON MULTIMEDIA AND UBIQUITOUS ENGINEERING, PROCEEDINGS, 2008, :197-200

[43] Quantum advantage in deciding NP-complete problems [J].

Nagy, Marius ;

Nagy, Naya .

QUANTUM INFORMATION PROCESSING, 2023, 22 (03)

[44] Quantum advantage in deciding NP-complete problems [J].

Marius Nagy ;

Naya Nagy .

Quantum Information Processing, 22

[45] Maximizing edge-ratio is NP-complete [J].

Noble, Steven D. ;

Hansen, Pierre ;

Mladenovic, Nenad .

DISCRETE APPLIED MATHEMATICS, 2011, 159 (18) :2276-2280

[46] Monadic logical definability of NP-complete problems [J].

Grandjean, E ;

Olive, F .

COMPUTER SCIENCE LOGIC, 1995, 933 :190-204

[47] Parametric runtime verification is NP-complete and coNP-complete [J].

Chen, Zhe .

INFORMATION PROCESSING LETTERS, 2017, 123 :14-20

[48] NP-COMPLETE NUMBER-THEORETIC PROBLEM [J].

GURARI, EM ;

IBARRA, OH .

JOURNAL OF THE ACM, 1979, 26 (03) :567-581

[49] The 2-Attractor Problem Is NP-Complete [J].

Fuchs, Janosch ;

Whittington, Philip .

41ST INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE, STACS 2024, 2024, 289

[50] k-L(2,1)-labelling for planar graphs is NP-complete for k ≥ 4 [J].

Eggemann, Nicole ;

Havet, Frederic ;

Noble, Steven D. .

DISCRETE APPLIED MATHEMATICS, 2010, 158 (16) :1777-1788

← 1 2 3 4 5 →