Complexity of Maximum Cut on Interval Graphs
Abstract
We resolve the longstanding open problem concerning the computational complexity of Max Cut on interval graphs by showing that it is NP-complete.
- Publication:
-
arXiv e-prints
- Pub Date:
- May 2020
- DOI:
- 10.48550/arXiv.2006.00061
- arXiv:
- arXiv:2006.00061
- Bibcode:
- 2020arXiv200600061A
- Keywords:
-
- Computer Science - Computational Complexity;
- Mathematics - Combinatorics