Name
Abstract | ||
|---|---|---|
Let gamma(m,n) denote the size of a minimum dominating set in the m x n grid graph. For the square grid graph, exact values for gamma(n,n) have earlier been published for n <= 19. By using a dynamic programming algorithm, the values of gamma(m,n) for m, n <= 29 are here obtained. Minimum dominating sets for square grid graphs up to size 29 x 29 are depicted. |
Year | Venue | Field |
|---|---|---|
2011 | ELECTRONIC JOURNAL OF COMBINATORICS | Dynamic programming,Graph,Discrete mathematics,Dominating set,Combinatorics,Square tiling,Domination analysis,Lattice graph,Grid,Minimum dominating set,Mathematics |
DocType | Volume | Issue |
Journal | 18.0 | 1.0 |
ISSN | Citations | PageRank |
1077-8926 | 8 | 0.69 |
References | Authors | |
4 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Samu Alanko | 1 | 8 | 0.69 |
| Simon Crevals | 2 | 10 | 2.12 |
| Anton Isopoussu | 3 | 10 | 1.51 |
| Patric R. J. Östergård | 4 | 609 | 70.61 |
| Ville Pettersson | 5 | 11 | 1.82 |