"Treewidth Is NP-Complete on Cubic Graphs."

Hans L. Bodlaender et al. (2023)

> Home

Details and statistics

DOI: 10.4230/LIPICS.IPEC.2023.7

access: open

type: Conference or Workshop Paper

metadata version: 2024-02-05

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/iwpec/BodlaenderBJKLM23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iwpec/BodlaenderBJKLM23
Hans L. Bodlaender, Édouard Bonnet, Lars Jaffke, Dusan Knop, Paloma T. Lima, Martin Milanic, Sebastian Ordyniak, Sukanya Pandey, Ondrej Suchý:
Treewidth Is NP-Complete on Cubic Graphs. IPEC 2023: 7:1-7:13

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.