Minimum dominating set of queens: a trivial programming exercise?
From MaRDI portal
Publication:968146
DOI10.1016/j.dam.2009.09.019zbMath1185.90212OpenAlexW2001655229MaRDI QIDQ968146
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
parameterized algorithmsexact algorithmsdomination problems\(\mathcal {NP}\)-completenesschess problems
Abstract computational complexity for mathematical programming problems (90C60) Dynamic programming (90C39)
Related Items (3)
Domination of the rectangular queen's graph ⋮ Domination in Chessboards ⋮ My Top 10 Graph Theory Conjectures and Open Problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Mixed searching and proper-path-width
- On the independent queens covering problem
- A simplified solution of the n queens' problem
- On bounds for a board covering problem
- Chessboard domination problems
- A dynamic programming solution to the \(n\)-queens problem
- The vertex separation number of a graph equals its path-width
- A partial k-arboretum of graphs with bounded treewidth
- Treewidth. Computations and approximations
- Domination by queens on a square beehive
- Independence for knights on hexagon and triangle boards
- An upper bound for the minimum number of queens covering the \(n {\times} n\) chessboard
- An improved upper bound for queens domination numbers
- Easy problems for tree-decomposable graphs
- Mixed Search Number of Permutation Graphs
- On the Fast Searching Problem
- On Exact Algorithms for Treewidth
- Algorithms – ESA 2005
- SOFSEM 2005: Theory and Practice of Computer Science
- Values of domination numbers of the queen's graph
This page was built for publication: Minimum dominating set of queens: a trivial programming exercise?
