• Aucun résultat trouvé

Minimum-Density Identifying Codes in Square Grids

N/A
N/A
Protected

Academic year: 2021

Partager "Minimum-Density Identifying Codes in Square Grids"

Copied!
13
0
0

Texte intégral

Loading

Figure

Fig. 1. Tile generating an optimal identifying code of the grid.
Fig. 2. The bottom rows (white disks) of K k .
Fig. 3. Tile of a minimum-density identifying code in S 3 .

Références

Documents relatifs

Results on the growth velocity (at fixed driving force) as a function of the temperature T and the ratio b/£ (b is the anomalous vertex energy and £ denotes the 6-vertex

Our main result, Theorem 3.1, is an enumerative interpretation of a class of quantum scattering diagrams, as introduced in Section 1, in terms of higher genus log Gromov-

L’accès à ce site Web et l’utilisation de son contenu sont assujettis aux conditions présentées dans le site LISEZ CES CONDITIONS ATTENTIVEMENT AVANT D’UTILISER CE SITE

More precisely, Alice follows the strategy S, with the slight change that if, at some turn, she is supposed to colour an edge that she has already coloured (such as uv), then

We apply the technique to cactus graphs and chordal graphs and obtain new algorithms for solving the eternal vertex cover problem in linear time for cactus graphs and quadratic time

This study aims: (i) to identify which woody species were able to establish themselves under closed canopy of coppice forests; and (ii) to evaluate the influences of canopy

Remark: In fact this immediately implies improved bounds for many other local search algorithms; e.g., it implies that the (3, 2)-local search gives 8-approximation to the

• Use a minimal number of colors?. mardi 3