MaxCut on Permutation Graphs is NP-complete
Celina M. H. de Figueiredo, Alexsander A. de Melo, Fabiano S., Oliveira, Ana Silva
TL;DR
This paper proves that the MaxCut problem remains NP-complete when restricted to permutation graphs, resolving a long-standing open problem in computational complexity.
Contribution
It establishes the NP-completeness of MaxCut on permutation graphs, a problem previously unresolved since 1985.
Findings
MaxCut is NP-complete on permutation graphs
Resolves a 1985 open problem
Impacts complexity understanding of graph problems
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems · Advanced Graph Theory Research · Graph Labeling and Dimension Problems