A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth (Q5691297): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/s0097539793251219 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2059372025 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 10:23, 30 July 2024
scientific article; zbMATH DE number 971587
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth |
scientific article; zbMATH DE number 971587 |
Statements
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth (English)
0 references
9 June 1997
0 references
graph algorithms
0 references
graph minors
0 references
tree-decomposition
0 references
pathwidth
0 references
