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]

Authors

Celina M. H. de Figueiredo

This author has not been identified. Look up 'Celina M. H. de Figueiredo' in Google

Alexsander Andrade de Melo

This author has not been identified. Look up 'Alexsander Andrade de Melo' in Google

Fabiano de S. Oliveira

This author has not been identified. Look up 'Fabiano de S. Oliveira' in Google

Ana Silva 0001

This author has not been identified. Look up 'Ana Silva 0001' in Google