On Linear Recognition of Tree-Width at Most Four (Q4875439)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On Linear Recognition of Tree-Width at Most Four |
scientific article; zbMATH DE number 869826
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.7373314
0 references
0.7356674
0 references
0.73461235
0 references
0 references
0.72945994
0 references
0.72877234
0 references
0.72830844
0 references
0.7280245
0 references
0.7277623
0 references
