The complexity of flood-filling games on graphs (Q423894)
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 flood-filling games on graphs |
scientific article; zbMATH DE number 6039464
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of flood-filling games on graphs |
scientific article; zbMATH DE number 6039464 |
Statements
The complexity of flood-filling games on graphs (English)
0 references
30 May 2012
0 references
computational complexity
0 references
graph colouring
0 references
0.9453471899032592
0 references
0.9129064083099364
0 references
0.9055255055427552
0 references
0.8903412222862244
0 references
