Tractability and hardness of flood-filling games on trees (Q2344738)
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 6436192
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Tractability and hardness of flood-filling games on trees |
scientific article; zbMATH DE number 6436192 |
Statements
Tractability and hardness of flood-filling games on trees (English)
0 references
18 May 2015
0 references
flood-filling games on trees
0 references
Flood-It
0 references
Free-Flood-It
0 references
shortest common supersequence
0 references
NP-hardness
0 references
W[1]-hardness
0 references
fixed-parameter tractability
0 references
phylogenetic colored trees
0 references
0 references
0.9546546339988708
0 references
0.8983684182167053
0 references
0.8800833821296692
0 references
0.8766334652900696
0 references
0.874538242816925
0 references
