Complexity of Maximum Cut on Interval Graphs

05/29/2020

∙

by   Ranendu Adhikary, et al.

∙

0

∙

share

We resolve the longstanding open problem concerning the computational complexity of Max Cut on interval graphs by showing that it is NP-complete.