Edge search in graphs with restricted test sets (Q1045083): Difference between revisions

@@ Property / cites work @@
+Q3994535
@@ Property / cites work: Q3994535 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3861131
@@ Property / cites work: Q3861131 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4398864
@@ Property / cites work: Q4398864 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4653767
@@ Property / cites work: Q4653767 / rank @@
+Normal rank
@@ Property / cites work @@
+A tight upper bound for group testing in graphs
@@ Property / cites work: A tight upper bound for group testing in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Competitive group testing
@@ Property / cites work: Competitive group testing / rank @@
+Normal rank
@@ Property / cites work @@
+Q5395177
@@ Property / cites work: Q5395177 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4193514
@@ Property / cites work: Q4193514 / rank @@
+Normal rank
@@ Property / cites work @@
+Searching for an edge in a graph with restricted test sets
+Normal rank
@@ Property / cites work @@
+A Method for Detecting All Defective Members in a Population by Group Testing
+Normal rank
@@ Property / cites work @@
+Q3977472
@@ Property / cites work: Q3977472 / rank @@
+Normal rank
@@ Property / cites work @@
+A probabilistic upper bound for the edge identification complexity of graphs
+Normal rank