"MaxCut on permutation graphs is NP-complete."

Celina M. H. de Figueiredo et al. (2023)

> Home

Details and statistics

DOI: 10.1002/JGT.22948

access: closed

type: Journal Article

metadata version: 2023-12-10

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jgt/FigueiredoMOS23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jgt/FigueiredoMOS23
Celina M. H. de Figueiredo, Alexsander Andrade de Melo, Fabiano de S. Oliveira, Ana Silva:
MaxCut on permutation graphs is NP-complete. J. Graph Theory 104(1): 5-16 (2023)

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.