Affiliation:
1. COPPE, Federal University of Rio de Janeiro Rio de Janeiro Brazil
2. IME, Rio de Janeiro State University Rio de Janeiro Brazil
3. Department of Mathematics, Federal University of Ceará Ceará Brazil
Abstract
AbstractThe decision problem MaxC
ut 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 M
axC
ut 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.
Funder
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior
Fundação Cearense de Apoio ao Desenvolvimento Científico e Tecnológico
Conselho Nacional de Desenvolvimento Científico e Tecnológico
Fundação Carlos Chagas Filho de Amparo à Pesquisa do Estado do Rio de Janeiro
Subject
Geometry and Topology,Discrete Mathematics and Combinatorics
Reference15 articles.
1. Complexity of Maximum Cut on Interval Graphs
2. On the complexity of the maximum cut problem
3. Graph Theory
4. Revising Johnson’s table for the 21st century
5. C. M. H.deFigueiredo A. A.deMelo F. S.Oliveira andA.Silva Maximum cut on interval graphs of interval count four isNP‐complete CoRR. abs/2012.09804 (2020).https://dblp.org/rec/journals/corr/abs-2012-09804.bib