The complexity of free-flood-it on \(2\times n\) boards (Q388453)
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: The complexity of free-flood-it on \(2\times n\) boards |
scientific article; zbMATH DE number 6239686
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of free-flood-it on \(2\times n\) boards |
scientific article; zbMATH DE number 6239686 |
Statements
The complexity of free-flood-it on \(2\times n\) boards (English)
0 references
19 December 2013
0 references
computational complexity
0 references
graph colouring
0 references
fixed parameter tractability
0 references
0.86327946
0 references
0.8623527
0 references
0 references
0.85379994
0 references
0 references
0.83507246
0 references
0.83126944
0 references
0.82905394
0 references
0.8265094
0 references
