English

Complexity of Maximum Cut on Interval Graphs

Computational Complexity 2021-04-01 v3 Combinatorics
Authors: Ranendu Adhikary , Kaustav Bose , Satwik Mukherjee , Bodhayan Roy
View on arXiv ↗ PDF ↗

Abstract

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

Keywords

graph algorithms graph theory computational complexity

Cite

@article{arxiv.2006.00061,
  title  = {Complexity of Maximum Cut on Interval Graphs},
  author = {Ranendu Adhikary and Kaustav Bose and Satwik Mukherjee and Bodhayan Roy},
  journal= {arXiv preprint arXiv:2006.00061},
  year   = {2021}
}

Related papers

View all related →
Computational Complexity · Computer Science
Maximum Cut on Interval Graphs of Interval Count Two is NP-complete
Alexey Barsukov, Bodhayan Roy
2024-04-25
Computational Complexity · Computer Science
Maximum cut on interval graphs of interval count four is NP-complete
Celina M. H. de Figueiredo, Alexsander A. de Melo, Fabiano S. Oliveira, Ana Silva
2022-11-30
Computational Complexity · Computer Science
MaxCut on Permutation Graphs is NP-complete
Celina M. H. de Figueiredo, Alexsander A. de Melo, Fabiano S. Oliveira, Ana Silva
2022-03-01
Discrete Mathematics · Computer Science
The Maximum Cardinality Cut Problem is Polynomial in Proper Interval Graphs
Arman Boyacı, Tinaz Ekim, Mordechai Shalom
2015-12-23
Data Structures and Algorithms · Computer Science
The Maximum Cut Problem in Co-bipartite Chain Graphs
Arman Boyacı, Tınaz Ekim, Mordechai Shalom
2015-04-15
Combinatorics · Mathematics
Budget-constrained cut problems
Justo Puerto, José L. Sainz-Pardo
2023-08-15
Discrete Mathematics · Computer Science
The Maximum Clique Problem in Multiple Interval Graphs
Mathew C. Francis, Daniel Gonçalves, Pascal Ochem
2012-03-12
Data Structures and Algorithms · Computer Science
Exact Algorithms for MaxCut on Split Graphs
Marko Lalovic
2024-06-03
Computational Complexity · Computer Science
On the Complexity of the K-way Vertex Cut Problem
Mohammed Lalou
2021-12-06
Data Structures and Algorithms · Computer Science
On the Maximum Cardinality Cut Problem in Proper Interval Graphs and Related Graph Classes
Arman Boyacı, Tınaz Ekim, Mordechai Shalom
2020-06-09
Data Structures and Algorithms · Computer Science
Parameterized Algorithms for Maximum Cut with Connectivity Constraints
Hiroshi Eto, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi
2019-08-12
Information Theory · Computer Science
On the Complexity of finding Stopping Distance in Tanner Graphs
K. Murali Krishnan, Priti Shankar
2008-07-21
Combinatorics · Mathematics
The complexity of the Perfect Matching-Cut problem
Valentin Bouquet, Christophe Picouleau
2021-11-01
Combinatorics · Mathematics
Finding Matching Cuts in $H$-Free Graphs
Felicia Lucke, Daniël Paulusma, Bernard Ries
2022-07-15
Data Structures and Algorithms · Computer Science
Maximum Cut Parameterized by Crossing Number
Markus Chimani, Christine Dahn, Martina Juhnke-Kubitzke, Nils M. Kriege +2
2020-07-23
Discrete Mathematics · Computer Science
NP-hardness results for partitioning graphs into disjoint cliques and a triangle-free subgraph
Carl Feghali, Faisal N. Abu-Khzam, Haiko Müller
2014-04-10
Data Structures and Algorithms · Computer Science
Improved Combinatorial Approximation Algorithms for MAX CUT in Sparse Graphs
Eiichiro Sato
2022-03-01
Data Structures and Algorithms · Computer Science
Is it possible to find the maximum clique in general graphs?
José Ignacio Alvarez-Hamelin
2012-02-21
Data Structures and Algorithms · Computer Science
Maximum Independent Sets in Subcubic Graphs: New Results
Ararat Harutyunyan, Michael Lampis, Vadim Lozin, Jérôme Monnot
2018-10-26
Quantum Physics · Physics
Quantum Speedup for the Maximum Cut Problem
Weng-Long Chang, Renata Wong, Wen-Yu Chung, Yu-Hao Chen +2
2023-06-14
Discrete Mathematics · Computer Science
A connected multidimensional maximum bisection problem
Zoran Maksimovic
2015-12-03
Data Structures and Algorithms · Computer Science
Fast Algorithms for the Maximum Clique Problem on Massive Sparse Graphs
Bharath Pattabiraman, Md. Mostofa Ali Patwary, Assefaw H. Gebremedhin, Wei-keng Liao +1
2012-11-15
Discrete Mathematics · Computer Science
On Covering a Graph Optimally with Induced Subgraphs
Shripad Thite
2007-05-23
Data Structures and Algorithms · Computer Science
Max-Cut under Graph Constraints
Jon Lee, Viswanath Nagarajan, Xiangkun Shen
2018-10-18
Computational Complexity · Computer Science
Edge Multiway Cut and Node Multiway Cut are NP-complete on subcubic graphs
Matthew Johnson, Barnaby Martin, Siani Smith, Sukanya Pandey +2
2024-08-20
R2 v1 2026-06-23T15:55:11.386Z