Complexity and monotonicity results for domination games (Q266262)
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: Complexity and monotonicity results for domination games |
scientific article; zbMATH DE number 6567990
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity and monotonicity results for domination games |
scientific article; zbMATH DE number 6567990 |
Statements
Complexity and monotonicity results for domination games (English)
0 references
13 April 2016
0 references
graph searching games
0 references
cops and robber games
0 references
domination search games
0 references
parameterized complexity
0 references
monotonicity
0 references
0.93295276
0 references
0.9185307
0 references
0.88938874
0 references
0.88266087
0 references
0.88244176
0 references
0.88244176
0 references
0.8776182
0 references
0.8766408
0 references
0.8765195
0 references
0.8737795
0 references
