scientific article; zbMATH DE number 7724211

DOI10.4230/lipics.mfcs.2021.38arXiv2012.09804MaRDI QIDQ6168453

Celina M. Herrera de Figueiredo, Unnamed Author, Alexsander A. de Melo, Fabiano S. Oliveira

Publication date: 8 August 2023

Full work available at URL: https://arxiv.org/abs/2012.09804

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

maximum cutNP-completeinterval graphsinterval countinterval lengths

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (3)

MaxCut on permutation graphs is NP‐complete ⋮ Maximum cut on interval graphs of interval count four is NP-complete ⋮ Complexity of maximum cut on interval graphs

This page was built for publication: