"Complexity of Maximum Cut on Interval Graphs" by Ranendu Adhikary, Kaustav Bose et al.
 

Complexity of Maximum Cut on Interval Graphs

Article Type

Research Article

Publication Title

Discrete and Computational Geometry

Abstract

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

First Page

307

Last Page

322

DOI

https://10.1007/s00454-022-00472-y

Publication Date

9-1-2023

Share

COinS