MaxCut on Permutation Graphs is NP-complete

In this paper, we prove that the MaxCut problem is NP-complete on permutation graphs, settling a long-standing open problem that appeared in the 1985 column of the "Ongoing Guide to NP-completeness" by David S. Johnson.

Gespeichert in:

Bibliographische Detailangaben
Hauptverfasser:	de Figueiredo, Celina M. H, de Melo, Alexsander A, Oliveira, Fabiano S, Silva, Ana
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science - Computational Complexity Computer Science - Discrete Mathematics Mathematics - Combinatorics
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	In this paper, we prove that the MaxCut problem is NP-complete on permutation graphs, settling a long-standing open problem that appeared in the 1985 column of the "Ongoing Guide to NP-completeness" by David S. Johnson.
DOI:	10.48550/arxiv.2202.13955