MaxCut on permutation graphs is NP‐complete

MaxCut on permutation graphs is NP‐complete

The 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 permutati...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of graph theory 2023-09, Vol.104 (1), p.5-16
Hauptverfasser: Figueiredo, Celina M. H., Melo, Alexsander A., Oliveira, Fabiano S., Silva, Ana
Format: Artikel
Sprache:eng
Schlagworte:
computational complexity
Graphs
maximum cut
NP‐complete
permutation graphs
Permutations
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The 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.
ISSN:0364-9024
1097-0118
DOI:10.1002/jgt.22948