MaxCut on permutation graphs is NP-complete

Celina M. H. de Figueiredo, Alexsander Andrade de Melo, Fabiano de S. Oliveira, Ana Silva 0001. MaxCut on permutation graphs is NP-complete. Journal of Graph Theory, 104(1):5-16, September 2023. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.