"Linear Time Algorithms for NP-hard Problems restricted to GaTEx Graphs."

Marc Hellmuth, Guillaume E. Scholz (2023)

> Home

Details and statistics

DOI: 10.48550/ARXIV.2306.04367

access: open

type: Informal or Other Publication

metadata version: 2023-06-13

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2306-04367
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2306-04367
Marc Hellmuth, Guillaume E. Scholz:
Linear Time Algorithms for NP-hard Problems restricted to GaTEx Graphs. CoRR abs/2306.04367 (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.