Pages that link to "Item:Q5915700"
From MaRDI portal
The following pages link to Minimum density of identifying codes of king grids (Q5915700):
Displaying 15 items.
- On identifying codes in the King grid that are robust against edge deletions (Q1010708) (← links)
- The minimum density of an identifying code in the king lattice. (Q1422415) (← links)
- Codes for identification in the king lattice (Q1423495) (← links)
- Periodicity of identifying codes in strips (Q1708274) (← links)
- Optimal identifying codes of two families of Cayley graphs (Q2166227) (← links)
- Watching systems in the King grid (Q2376080) (← links)
- New bounds for (\(r, \leq 2\))-identifying codes in the infinite king grid (Q2380847) (← links)
- An improved lower bound for \((1,\leq 2)\)-identifying codes in the king grid (Q2437959) (← links)
- Optimal identifying codes in the infinite 3-dimensional king grid (Q2441660) (← links)
- Spy game: FPT-algorithm, hardness and graph products (Q2672629) (← links)
- Spy game: FPT-algorithm and results on graph products (Q2695339) (← links)
- Minimum-Density Identifying Codes in Square Grids (Q2830060) (← links)
- Locating-Domination and Identification (Q3384611) (← links)
- Minimum density of identifying codes of king grids (Q5920174) (← links)
- Density of identifying codes of hexagonal grids with finite number of rows (Q6550909) (← links)