Tolerant identification with Euclidean balls (Q5326789): Difference between revisions

@@ Property / arXiv ID @@
+.1913
@@ Property / arXiv ID: 1109.1913 / rank @@
+Normal rank
@@ Property / cites work @@
+Exact Minimum Density of Codes Identifying Vertices in the Square Grid
+Normal rank
@@ Property / cites work @@
+The minimum density of an identifying code in the king lattice.
+Normal rank
@@ Property / cites work @@
+An optimal edge-robust identifying code in the triangular lattice
+Normal rank
@@ Property / cites work @@
+On robust and dynamic identifying codes
@@ Property / cites work: On robust and dynamic identifying codes / rank @@
+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 identifying codes that are robust against edge changes
+Normal rank
@@ Property / cites work @@
+On the density of identifying codes in the square lattice
+Normal rank
@@ Property / cites work @@
+Identification in \(\mathbb Z^2\) using Euclidean balls
+Normal rank
@@ Property / cites work @@
+On a new class of codes for identifying vertices in graphs
+Normal rank
@@ Property / cites work @@
+Identifying and Locating–Dominating Codes in (Random) Geometric Networks
+Normal rank
@@ Property / cites work @@
+Fault-tolerant locating-dominating sets
@@ Property / cites work: Fault-tolerant locating-dominating sets / rank @@
+Normal rank