Maximum Cut on Interval Graphs of Interval Count Four Is NP-Complete

Celina M. H. de Figueiredo, Alexsander Andrade de Melo, Fabiano de S. Oliveira, Ana Silva 0001. Maximum Cut on Interval Graphs of Interval Count Four Is NP-Complete. In Filippo Bonchi, Simon J. Puglisi, editors, 46th International Symposium on Mathematical Foundations of Computer Science, MFCS 2021, August 23-27, 2021, Tallinn, Estonia. Volume 202 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.