Complexity of Maximum Cut on Interval Graphs

Authors

Ranendu Adhikary, Jadavpur University
Kaustav Bose, Indian Statistical Institute, Kolkata
Satwik Mukherjee, Jadavpur University
Bodhayan Roy, Indian Institute of Technology Kharagpur

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

Recommended Citation

Adhikary, Ranendu; Bose, Kaustav; Mukherjee, Satwik; and Roy, Bodhayan, "Complexity of Maximum Cut on Interval Graphs" (2023). Journal Articles. 3613.
https://digitalcommons.isical.ac.in/journal-articles/3613