Hardness of computing width parameters based on branch decompositions over the vertex set (Q5890909)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6639384
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Hardness of computing width parameters based on branch decompositions over the vertex set |
scientific article; zbMATH DE number 6639384 |
Statements
Hardness of computing width parameters based on branch decompositions over the vertex set (English)
0 references
14 October 2016
0 references
complexity
0 references
Boolean width
0 references
branch decomposition
0 references
cut function
0 references
mim-width
0 references
0 references
0.9966135621070862
0 references
0.7618263363838196
0 references
0.7557166814804077
0 references
0.7508671283721924
0 references
