Pages that link to "Item:Q1422415"
From MaRDI portal
The following pages link to The minimum density of an identifying code in the king lattice. (Q1422415):
Displayed 22 items.
- Information retrieval and the average number of input clues (Q514538) (← links)
- 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)
- A family of optimal identifying codes in \(\mathbb Z^2\) (Q855875) (← links)
- On robust identification in the square and King grids (Q860410) (← links)
- Optimal \(t\)-edge-robust \(r\)-identifying codes in the king lattice (Q882790) (← links)
- Adaptive identification in graphs (Q958720) (← links)
- Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori (Q1406036) (← links)
- Paths and cycles identifying vertices in twisted cubes (Q1636884) (← links)
- On identification in the triangular grid (Q1826954) (← links)
- Identifying and locating-dominating codes on chains and cycles (Q1883609) (← links)
- Optimal identifying codes of two families of Cayley graphs (Q2166227) (← links)
- On two variations of identifying codes (Q2275454) (← links)
- New bounds for (\(r, \leq 2\))-identifying codes in the infinite king grid (Q2380847) (← links)
- New results on variants of covering codes in Sierpiński graphs (Q2391669) (← 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)
- Optimal \((r,\leq 3)\)-locating-dominating codes in the infinite king grid (Q2444553) (← links)
- Identifying codes of corona product graphs (Q2449061) (← links)
- Locating-Domination and Identification (Q3384611) (← links)
- Tolerant identification with Euclidean balls (Q5326789) (← links)