A family of optimal identifying codes in \(\mathbb Z^2\) (Q855875): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.jcta.2006.03.011
+Normal rank
@@ Property / OpenAlex ID @@
+W2095154901
@@ Property / OpenAlex ID: W2095154901 / rank @@
+Normal rank
@@ Property / cites work @@
+General bounds for identifying codes in some infinite regular graphs
+Normal rank
@@ Property / cites work @@
+Identifying codes with small radius 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 @@
+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 @@
+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 @@
+Optimal \(t\)-edge-robust \(r\)-identifying codes in the king lattice
+Normal rank