On the computational complexity of the domination game (Q2800503)
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: On the computational complexity of the domination game |
scientific article; zbMATH DE number 6569607
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the computational complexity of the domination game |
scientific article; zbMATH DE number 6569607 |
Statements
15 April 2016
0 references
domination game
0 references
game domination number
0 references
complexity of algorithms
0 references
On the computational complexity of the domination game (English)
0 references
0.8794419169425964
0 references
0.864892840385437
0 references
0.81679767370224
0 references
0.8002610206604004
0 references
0.7885014414787292
0 references
