Maximum Cut on Interval Graphs of Interval Count Two is NP-complete

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Barsukov, Alexey, Roy, Bodhayan
Format:	Preprint
Published:	2022
Subjects:	Computational Complexity Combinatorics 35A01, 65L10, 65L12, 65L20, 65L70
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Internet

https://arxiv.org/abs/2203.06630