We resolve the longstanding open problem concerning the computational complexity of Max Cut on interval graphs by showing that it is NP-complete.
翻译:我们通过显示其已完成NP,解决了在间隔图上的Max Cut的计算复杂性方面长期存在的未决问题。