Let denote the Cartesian product of two graphs and . In 1994, Livingston and Stout [Constant time computation of minimum dominating sets, Congr. Numer., 105 (1994), 116-128] introduced a linear time algorithm to determine for fixed , and claimed that may be substituted with any graph from a one-parameter family, such as a cycle of length or a complete -ary tree of height for fixed . We explore how the algorithm may be modified to accommodate such graphs and propose a general framework to determine for any graph . Furthermore, we illustrate its use in determining the domination number of the generalized Cartesian product , as defined by Benecke and Mynhardt [Domination of Generalized Cartesian Products, preprint (2009)].