Parameterized complexity of binary CSP: vertex cover, treedepth, and related parameters (Q6638020)
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: Parameterized complexity of binary CSP: vertex cover, treedepth, and related parameters |
scientific article; zbMATH DE number 7944065
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parameterized complexity of binary CSP: vertex cover, treedepth, and related parameters |
scientific article; zbMATH DE number 7944065 |
Statements
Parameterized complexity of binary CSP: vertex cover, treedepth, and related parameters (English)
0 references
14 November 2024
0 references
parameterized complexity
0 references
constraint satisfaction problems
0 references
binary CSP
0 references
list coloring
0 references
vertex cover
0 references
treedepth
0 references
W-hierarchy
0 references
