New bounds on the minimum density of an identifying code for the infinite hexagonal grid (Q2446882): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2033439974
@@ Property / OpenAlex ID: W2033439974 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.1097
@@ Property / arXiv ID: 1110.1097 / rank @@
+Normal rank
@@ Property / cites work @@
+Exact Minimum Density of Codes Identifying Vertices in the Square Grid
+Normal rank
@@ Property / cites work @@
+Bounds for Codes Identifying Vertices in the Hexagonal Grid
+Normal rank
@@ Property / cites work @@
+A new lower bound on the density of vertex identifying codes for the infinite hexagonal grid
+Normal rank
@@ Property / cites work @@
+Identification in \(\mathbb Z^2\) using Euclidean balls
+Normal rank
@@ Property / cites work @@
+Optimal lower bound for 2-identifying codes in the hexagonal grid
+Normal rank
@@ Property / cites work @@
+On a new class of codes for identifying vertices in graphs
+Normal rank
@@ Property / cites work @@
+Lower bounds for identifying codes in some infinite grids
+Normal rank
@@ Property / cites work @@
+Improved Bounds for<i>r</i>-Identifying Codes of the Hex Grid
+Normal rank