Minimum dominating set of queens: a trivial programming exercise?
DOI10.1016/J.DAM.2009.09.019zbMATH Open1185.90212OpenAlexW2001655229MaRDI QIDQ968146FDOQ968146
Authors: Henning Fernau 
Publication date: 5 May 2010
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2009.09.019
Recommendations
exact algorithmsparameterized algorithmsdomination problems\(\mathcal {NP}\)-completenesschess problems
Dynamic programming (90C39) Abstract computational complexity for mathematical programming problems (90C60)
Cites Work
- A partial k-arboretum of graphs with bounded treewidth
- Easy problems for tree-decomposable graphs
- On Exact Algorithms for Treewidth
- Chessboard domination problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Treewidth. Computations and approximations
- The vertex separation number of a graph equals its path-width
- On the Fast Searching Problem
- Mixed Search Number of Permutation Graphs
- Mixed searching and proper-path-width
- SOFSEM 2005: Theory and Practice of Computer Science
- Algorithms – ESA 2005
- On the independent queens covering problem
- An improved upper bound for queens domination numbers
- Values of domination numbers of the queen's graph
- A simplified solution of the n queens' problem
- An upper bound for the minimum number of queens covering the \(n {\times} n\) chessboard
- On bounds for a board covering problem
- A dynamic programming solution to the \(n\)-queens problem
- Domination by queens on a square beehive
- Independence for knights on hexagon and triangle boards
- Title not available (Why is that?)
- An improved lower bound for domination numbers of the queen's graph
Cited In (4)
This page was built for publication: Minimum dominating set of queens: a trivial programming exercise?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q968146)
