2000 character limit reached
MaxCut on Permutation Graphs is NP-complete (2202.13955v1)
Published 28 Feb 2022 in cs.CC, cs.DM, and math.CO
Abstract: 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.