On identification in the triangular grid (Q1826954): Difference between revisions

@@ Property / author @@
-Iiro S. Honkala
@@ Property / author: Iiro S. Honkala / rank @@
-Normal rank
@@ Property / author @@
+Iiro S. Honkala
@@ Property / author: Iiro S. Honkala / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.jctb.2003.10.002
+Normal rank
@@ Property / OpenAlex ID @@
+W2014157723
@@ Property / OpenAlex ID: W2014157723 / rank @@
+Normal rank
@@ Property / cites work @@
+General bounds for identifying codes in some infinite regular graphs
+Normal rank
@@ Property / cites work @@
+The minimum density of an identifying code in the king lattice.
+Normal rank
@@ Property / cites work @@
+Identifying codes with small radius in some infinite regular graphs
+Normal rank
@@ Property / cites work @@
+Identifying and locating-dominating codes: NP-completeness results for directed graphs
+Normal rank
@@ Property / cites work @@
+Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard.
+Normal rank
@@ Property / cites work @@
+New bounds for codes identifying vertices in graphs
+Normal rank
@@ Property / cites work @@
+Bounds for Codes Identifying Vertices in the Hexagonal Grid
+Normal rank
@@ Property / cites work @@
+On codes identifying vertices in the two-dimensional square lattice with diagonals
+Normal rank
@@ Property / cites work @@
+Q2717197
@@ Property / cites work: Q2717197 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4368728
@@ Property / cites work: Q4368728 / rank @@
+Normal rank
@@ Property / cites work @@
+On the identification of sets of points in the square lattice
+Normal rank
@@ Property / cites work @@
+Codes for identification in the king lattice
@@ Property / cites work: Codes for identification in the king lattice / rank @@
+Normal rank
@@ Property / cites work @@
+On the density of identifying codes in the square lattice
+Normal rank
@@ Property / cites work @@
+On the complexity of the identification problem in Hamming spaces
+Normal rank
@@ Property / cites work @@
+On identifying codes in binary Hamming spaces
@@ Property / cites work: On identifying codes in binary Hamming spaces / rank @@
+Normal rank
@@ Property / cites work @@
+On a new class of codes for identifying vertices in graphs
+Normal rank
@@ Property / cites work @@
+Fault-tolerant locating-dominating sets
@@ Property / cites work: Fault-tolerant locating-dominating sets / rank @@
+Normal rank