We use a dynamic programming algorithm to establish a lower bound on the domination number of complete grid graphs of the form C n □ P m , that is, the Cartesian product of a cycle C n and a path P m , for m and n sufficiently large.
No takes yet. Share an insight, caveat, or question.
David R. Guichard (2024) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: