Minimum dominating set of queens: a trivial programming exercise?
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1330033 (Why is no real title available?)
- scientific article; zbMATH DE number 683826 (Why is no real title available?)
- scientific article; zbMATH DE number 1161563 (Why is no real title available?)
- scientific article; zbMATH DE number 844149 (Why is no real title available?)
- A dynamic programming solution to the n-queens problem
- A partial k-arboretum of graphs with bounded treewidth
- A simplified solution of the n queens' problem
- Algorithms – ESA 2005
- An improved lower bound for domination numbers of the queen's graph
- An improved upper bound for queens domination numbers
- An upper bound for the minimum number of queens covering the \(n {\times} n\) chessboard
- Chessboard domination problems
- Domination by queens on a square beehive
- Easy problems for tree-decomposable graphs
- Independence for knights on hexagon and triangle boards
- Mixed Search Number of Permutation Graphs
- Mixed searching and proper-path-width
- On Exact Algorithms for Treewidth
- On bounds for a board covering problem
- On the Fast Searching Problem
- On the independent queens covering problem
- SOFSEM 2005: Theory and Practice of Computer Science
- The vertex separation number of a graph equals its path-width
- Treewidth. Computations and approximations
- Values of 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)
