{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,28]],"date-time":"2026-05-28T02:15:08Z","timestamp":1779934508143,"version":"3.53.1"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>Let $\\gamma_{m,n}$ denote the size of a minimum dominating set in the  $m \\times n$ grid graph. For the square grid graph, exact values  for $\\gamma_{n,n}$ have earlier been published for $n \\leq 19$. By using a  dynamic programming algorithm, the values of $\\gamma_{m,n}$ for $m,n \\leq 29$ are here obtained. Minimum dominating sets for square grid graphs up to size $29 \\times 29$ are depicted.<\/jats:p>","DOI":"10.37236\/628","type":"journal-article","created":{"date-parts":[[2020,1,11]],"date-time":"2020-01-11T03:44:17Z","timestamp":1578714257000},"source":"Crossref","is-referenced-by-count":26,"title":["Computing the Domination Number of Grid Graphs"],"prefix":"10.37236","volume":"18","author":[{"given":"Samu","family":"Alanko","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Simon","family":"Crevals","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Anton","family":"Isopoussu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Patric","family":"\u00d6sterg\u00e5rd","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ville","family":"Pettersson","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"23455","published-online":{"date-parts":[[2011,7,15]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v18i1p141\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v18i1p141\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T23:08:19Z","timestamp":1579302499000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v18i1p141"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7,15]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2011,1,5]]}},"URL":"https:\/\/doi.org\/10.37236\/628","relation":{},"ISSN":["1077-8926"],"issn-type":[{"value":"1077-8926","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,7,15]]},"article-number":"P141"}}