Title of article :
minimum dominating set of queens: A trivial programming exercise? Original Research Article
Author/Authors :
Henning Fernau، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2010
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.
Keywords :
Exact algorithms , NPNP-completeness , Chess problems , Domination problems , Parameterized algorithms
Journal title :
Discrete Applied Mathematics
Journal title :
Discrete Applied Mathematics