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 条
12345