default search action
"Maximum Cut on Interval Graphs of Interval Count Four Is NP-Complete."
Celina M. H. de Figueiredo et al. (2021)
- Celina M. H. de Figueiredo, Alexsander Andrade de Melo, Fabiano de S. Oliveira, Ana Silva:
Maximum Cut on Interval Graphs of Interval Count Four Is NP-Complete. MFCS 2021: 38:1-38:15
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.