A linear time algorithm for finding tree-decompositions of small treewidth (Q5248490): Difference between revisions
From MaRDI portal
Changed an Item |
Created claim: DBLP publication ID (P1635): conf/stoc/Bodlaender93, #quickstatements; #temporary_batch_1731468600454 |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2024291212 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q59568000 / rank | |||
Normal rank | |||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: conf/stoc/Bodlaender93 / rank | |||
Normal rank | |||
Latest revision as of 05:26, 13 November 2024
scientific article; zbMATH DE number 6434234
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A linear time algorithm for finding tree-decompositions of small treewidth |
scientific article; zbMATH DE number 6434234 |
Statements
A linear time algorithm for finding tree-decompositions of small treewidth (English)
0 references
7 May 2015
0 references
graph algorithms
0 references
graph minors
0 references
pathwidth
0 references
treewidth
0 references
