Exact values for three domination-like problems in circular and infinite grid graphs of small height - Bouznif, Marwane; Darlay, Julien; Moncel, Julien; Preissmann, Myriam (Discrete Mathematics and Theoretical Computer Science, 2019)
Keywords: [info.info-dm]computer science [cs]/discrete mathematics [cs.dm]; acm: g.: mathematics of computing/g.2: discrete mathematics/g.2.2: graph theory; acm: g.: mathematics of computing/g.2: discrete mathematics/g.2.2: graph theory/g.2.2.0: graph algorithms; acm: g.: mathematics of computing/g.2: discrete mathematics/g.2.2: graph theory/g.2.2.1: graph labeling; acm: g.: mathematics of computing/g.2: discrete mathematics/g.2.2: graph theory/g.2.2.4: path and circuit problems; Algorithms; Codes; Coding theory; Computer Science; Discrete Mathematics; graph algorithm; Graph theory; Graphs; grid; identifying code; locating-dominating code; locating-total-dominating code; Mathematical research; France; locating-dominating code; locating-total-dominating code; identifying code; graph algorithm; grid