Pages that link to "Item:Q1850615"
From MaRDI portal
The following pages link to On the density of identifying codes in the square lattice (Q1850615):
Displaying 22 items.
- Identification in \(\mathbb Z^2\) using Euclidean balls (Q628317) (← links)
- Identifying codes and locating-dominating sets on paths and cycles (Q642979) (← links)
- On a new class of identifying codes in graphs (Q845971) (← links)
- On robust identification in the square and King grids (Q860410) (← links)
- New bounds on binary identifying codes (Q947104) (← links)
- On the size of identifying codes in binary hypercubes (Q1024996) (← links)
- New bounds for codes identifying vertices in graphs (Q1283874) (← links)
- The minimum density of an identifying code in the king lattice. (Q1422415) (← links)
- Codes for identification in the king lattice (Q1423495) (← links)
- On identification in the triangular grid (Q1826954) (← links)
- Identifying codes of degree 4 Cayley graphs over abelian groups (Q2346707) (← links)
- New lower bound for 2-identifying code in the square grid (Q2446847) (← links)
- Locating sensors in paths and cycles: the case of 2-identifying codes (Q2462318) (← links)
- On identifying codes (Q2717197) (← links)
- Minimum-Density Identifying Codes in Square Grids (Q2830060) (← links)
- Vertex identifying codes for the \(n\)-dimensional lattice (Q2906869) (← links)
- Liar's domination (Q3057104) (← links)
- Locating-Domination and Identification (Q3384611) (← links)
- Tolerant identification with Euclidean balls (Q5326789) (← links)
- Density of identifying codes of hexagonal grids with finite number of rows (Q6550909) (← links)
- On Iiro Honkala's contributions to identifying codes (Q6614534) (← links)
- Finding codes on infinite grids automatically (Q6614543) (← links)
