Deterministic Single Exponential Time Algorithms for Connectivity Problems Parameterized by Treewidth (Q5326561): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q59567500, #quickstatements; #temporary_batch_1710879948957 |
Created claim: DBLP publication ID (P1635): conf/icalp/BodlaenderCKN13, #quickstatements; #temporary_batch_1731508824982 |
||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: conf/icalp/BodlaenderCKN13 / rank | |||
Normal rank | |||
Latest revision as of 16:35, 13 November 2024
scientific article; zbMATH DE number 6195425
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Deterministic Single Exponential Time Algorithms for Connectivity Problems Parameterized by Treewidth |
scientific article; zbMATH DE number 6195425 |
Statements
Deterministic Single Exponential Time Algorithms for Connectivity Problems Parameterized by Treewidth (English)
0 references
6 August 2013
0 references
