Parameterized complexity of flood-filling games on trees (Q4925268)
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 6174183
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parameterized complexity of flood-filling games on trees |
scientific article; zbMATH DE number 6174183 |
Statements
Parameterized Complexity of Flood-Filling Games on Trees (English)
0 references
11 June 2013
0 references
combinatorial games
0 references
fixed-parameter tractability
0 references
graph algorithms
0 references
NP-hardness
0 references
W[1]-hardness
0 references
0.9546546339988708
0 references
0.9035839438438416
0 references
0.8654183149337769
0 references
0.8585183620452881
0 references
0.8516324162483215
0 references
