Minimum dominating set of queens: a trivial programming exercise? (Q968146)
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: Minimum dominating set of queens: a trivial programming exercise? |
scientific article; zbMATH DE number 5703733
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimum dominating set of queens: a trivial programming exercise? |
scientific article; zbMATH DE number 5703733 |
Statements
Minimum dominating set of queens: a trivial programming exercise? (English)
0 references
5 May 2010
0 references
exact algorithms
0 references
parameterized algorithms
0 references
\(\mathcal {NP}\)-completeness
0 references
chess problems
0 references
domination problems
0 references
0 references
0.7868865728378296
0 references
0.7829298973083496
0 references
0.7816328406333923
0 references
0.7695180177688599
0 references
