| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 420343 | Discrete Applied Mathematics | 2010 | 11 Pages |
Abstract
minimum dominating set of queens is one of the typical programming exercises of a first year’s computer science course. However, little work has been published on the complexity of this problem. We analyse here several algorithms and show that advanced algorithmic techniques may dramatically speed up solving this problem.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Henning Fernau,