Codes identifying sets of vertices in random networks (Q870971): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.disc.2006.07.041
+Normal rank
@@ Property / OpenAlex ID @@
+W2154298980
@@ Property / OpenAlex ID: W2154298980 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2784326
@@ Property / cites work: Q2784326 / rank @@
+Normal rank
@@ Property / cites work @@
+Paths in graphs
@@ Property / cites work: Paths in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Bounds on the length of disjunctive codes
@@ Property / cites work: Bounds on the length of disjunctive codes / rank @@
+Normal rank
@@ Property / cites work @@
+Q4074927
@@ Property / cites work: Q4074927 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3286850
@@ Property / cites work: Q3286850 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3291948
@@ Property / cites work: Q3291948 / rank @@
+Normal rank
@@ Property / cites work @@
+On \(r\)-cover-free families
@@ Property / cites work: On \(r\)-cover-free families / rank @@
+Normal rank
@@ Property / cites work @@
+New versions of Suen's correlation inequality
@@ Property / cites work: New versions of Suen's correlation inequality / rank @@
+Normal rank
@@ Property / cites work @@
+Q4519896
@@ Property / cites work: Q4519896 / rank @@
+Normal rank
@@ Property / cites work @@
+On a new class of codes for identifying vertices in graphs
+Normal rank
@@ Property / cites work @@
+Nonrandom binary superimposed codes
@@ Property / cites work: Nonrandom binary superimposed codes / rank @@
+Normal rank
@@ Property / cites work @@
+Families of optimal codes for strong identification
+Normal rank
@@ Property / cites work @@
+Two families of optimal identifying codes in binary Hamming spaces
+Normal rank
@@ Property / cites work @@
+On the upper bound of the size of the \(r\)-cover-free families
+Normal rank
@@ Property / cites work @@
+A correlation inequality and a poisson limit theorem for nonoverlapping balanced subgraphs of a random graph
+Normal rank