On Linear Recognition of Tree-Width at Most Four (Q4875439): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/s0895480193243043 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2067514766 / rank | |||
Normal rank | |||
Latest revision as of 12:01, 30 July 2024
scientific article; zbMATH DE number 869826
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On Linear Recognition of Tree-Width at Most Four |
scientific article; zbMATH DE number 869826 |
Statements
On Linear Recognition of Tree-Width at Most Four (English)
0 references
29 September 1996
0 references
linear recognition
0 references
graph algorithm
0 references
NP-hard
0 references
tree-width
0 references
linear time complexity
0 references
\(k\)-elimination sequence
0 references
linear time algorithm
0 references
