Chessboard domination on programmable graphics hardware

Abstract

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… (More)
DOI: 10.1145/1185448.1185463

Topics

8 Figures and Tables

Slides referencing similar topics