Pages that link to "Item:Q3604840"
From MaRDI portal
The following pages link to Identifying Codes and Covering Problems (Q3604840):
Displaying 12 items.
- Identification in \(\mathbb Z^2\) using Euclidean balls (Q628317) (← links)
- On the (adjacency) metric dimension of corona and strong product graphs and their local variants: combinatorial and computational results (Q1693144) (← links)
- Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes (Q2018540) (← links)
- Open locating-dominating sets in circulant graphs (Q2062672) (← links)
- Improved upper bounds for identifying codes in \(n\)-dimensional \(q\)-ary cubes (Q2186954) (← links)
- Constructions of \(r\)-identifying codes and \((r, \leq l)\)-identifying codes (Q2283219) (← links)
- On graphs on \(n\) vertices having an identifying code of cardinality \(\lceil \log_{2}(n+1)\rceil\) (Q2506367) (← links)
- Identifying Codes in Hereditary Classes of Graphs and VC-Dimension (Q3449863) (← links)
- r-Identifying codes in binary Hamming space, q-ary Lee space and incomplete hypercube (Q4634300) (← links)
- Bounds on r-identifying codes in q-ary Lee space (Q4986273) (← links)
- Discriminating Codes in Geometric Setups (Q6065423) (← links)
- Complexity and approximation for discriminating and identifying code problems in geometric setups (Q6107885) (← links)