"Maximum cut on interval graphs of interval count two is NP-complete."

Alexey Barsukov, Kaustav Bose, Bodhayan Roy (2022)

> Home

Details and statistics

DOI: 10.48550/ARXIV.2203.06630

access: open

type: Informal or Other Publication

metadata version: 2022-03-16

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2203-06630
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2203-06630
Alexey Barsukov, Kaustav Bose, Bodhayan Roy:
Maximum cut on interval graphs of interval count two is NP-complete. CoRR abs/2203.06630 (2022)

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.