AI Chat AI Image Generator AI Video Text to Speech

Complexity of Maximum Cut on Interval Graphs

05/29/2020

∙

by Ranendu Adhikary, et al.

∙

∙

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

Ranendu Adhikary
6 publications
Kaustav Bose
11 publications
Satwik Mukherjee
1 publication
Bodhayan Roy
12 publications

page 1

page 2

page 3

page 4

research

∙ 03/13/2022

Maximum cut on interval graphs of interval count two is NP-complete

We show that the Max-Cut problem is NP-complete on interval graphs of in...

0 Alexey Barsukov, et al. ∙

research

∙ 12/17/2020

Maximum cut on interval graphs of interval count four is NP-complete

The computational complexity of the MaxCut problem restricted to interva...

0 Celina M. H. de Figueiredo, et al. ∙

research

∙ 07/14/2022

Finding Matching Cuts in H-Free Graphs

The NP-complete problem Matching Cut is to decide if a graph has a match...

0 Felicia Lucke, et al. ∙

research

∙ 02/02/2022

Orthogonal Fold Cut

We characterize the shapes that can be produced by "orthogonal fold ...

0 Joshua Ani, et al. ∙

research

∙ 01/27/2023

A Characterization of Complexity in Public Goods Games

We complete the characterization of the computational complexity of equi...

0 Matan Gilboa, et al. ∙

research

∙ 09/13/2018

Computational complexity of the Rydberg blockade in two dimensions

We discuss the computational complexity of finding the ground state of t...

0 Hannes Pichler, et al. ∙

research

∙ 06/06/2020

On the Maximum Cardinality Cut Problem in Proper Interval Graphs and Related Graph Classes

Although it has been claimed in two different papers that the maximum ca...

0 Arman Boyacı, et al. ∙