Pages that link to "Item:Q2446847"
From MaRDI portal
The following pages link to New lower bound for 2-identifying code in the square grid (Q2446847):
Displaying 12 items.
- IDonSquareGridR2 (Q40059) (← links)
- Optimal lower bound for 2-identifying codes in the hexagonal grid (Q456287) (← links)
- Lower bounds for identifying codes in some infinite grids (Q1960276) (← links)
- Many-to-many two-disjoint path covers in cylindrical and toroidal grids (Q2341724) (← 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)
- New lower bound for 2-identifying code in the square grid (Q2446847) (← links)
- Minimum-Density Identifying Codes in Square Grids (Q2830060) (← links)
- Improved Bounds for<i>r</i>-Identifying Codes of the Hex Grid (Q3094905) (← links)
- Locating-Domination and Identification (Q3384611) (← links)
- On Iiro Honkala's contributions to identifying codes (Q6614534) (← links)
- Finding codes on infinite grids automatically (Q6614543) (← links)