AI Chat AI Image Generator AI Video Text to Speech

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

03/13/2022

∙

by Alexey Barsukov, et al.

∙

∙

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

Alexey Barsukov
3 publications
Kaustav Bose
11 publications
Bodhayan Roy
12 publications

page 1

page 2

page 3

page 4

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

∙ 05/29/2020

Complexity of Maximum Cut on Interval Graphs

We resolve the longstanding open problem concerning the computational co...

0 Ranendu Adhikary, et al. ∙

research

∙ 06/09/2019

The Packed Interval Covering Problem is NP-complete

We introduce a new decision problem, called Packed Interval Covering (PI...

0 Abdallah Saffidine, et al. ∙

research

∙ 05/23/2018

Análisis estadístico ex post del conteo rápido institucional de la elección de gobernador del Estado de México en el año 2017

A statistical analysis of an electoral quick count based on the total co...

0 Arturo Erdely, et al. ∙

research

∙ 11/09/2018

A note on simultaneous representation problem for interval and circular-arc graphs

In this short note, we show two NP-completeness results regarding the si...

0 Jan Bok, et al. ∙

research

∙ 08/23/2019

Simultaneous Representation of Proper and Unit Interval Graphs

In a confluence of combinatorics and geometry, simultaneous representati...

0 Ignaz Rutter, 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. ∙