"Known Algorithms on Graphs of Bounded Treewidth Are Probably Optimal."

Daniel Lokshtanov, Dániel Marx, Saket Saurabh (2018)

> Home

Details and statistics

DOI: 10.1145/3170442

access: closed

type: Journal Article

metadata version: 2025-01-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/talg/LokshtanovMS18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/talg/LokshtanovMS18
Daniel Lokshtanov, Dániel Marx, Saket Saurabh:
Known Algorithms on Graphs of Bounded Treewidth Are Probably Optimal. ACM Trans. Algorithms 14(2): 13:1-13:30 (2018)

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.