The crippled queen placement problem
Science of Computer Programming
Chessboard domination problems
Discrete Mathematics - Topics on domination
Domination and irredundance in the queens' graph
Discrete Mathematics
Upper bounds for domination numbers of the queen's graph
Discrete Mathematics
Ray tracing on programmable graphics hardware
Proceedings of the 29th annual conference on Computer graphics and interactive techniques
An upper bound for the minimum number of queens covering the n × n chessboard
Discrete Applied Mathematics
An improved upper bound for queens domination numbers
Discrete Mathematics - Special issue: The 18th British combinatorial conference
Exploring the VLSI Scalability of Stream Processors
HPCA '03 Proceedings of the 9th International Symposium on High-Performance Computer Architecture
Simulation of cloud dynamics on graphics hardware
Proceedings of the ACM SIGGRAPH/EUROGRAPHICS conference on Graphics hardware
Linear algebra operators for GPU implementation of numerical algorithms
ACM SIGGRAPH 2003 Papers
Sparse matrix solvers on the GPU: conjugate gradients and multigrid
ACM SIGGRAPH 2003 Papers
Brook for GPUs: stream computing on graphics hardware
ACM SIGGRAPH 2004 Papers
| Hi-index | 0.00 |
In this paper we present an algorithm to compute the minimum dominating number of a chessboard graph given any chess piece. We use the CPU to compute possible minimally dominating sets, which we then send to programmable graphics hardware to determine the set's domination. We find that the GPU accelerated algorithm performs better than a comparable CPU based algorithm for board sizes greater than 9. To our knowledge, this paper presents the first algorithm to determine the minimum domination number of a chessboard graph using the GPU.