A competitive algorithm in searching for many edges in a hypergraph (Q869578): Difference between revisions

@@ Property / DOI @@
-.1016/j.dam.2006.07.008
@@ Property / DOI: 10.1016/j.dam.2006.07.008 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.dam.2006.07.008
+Normal rank
@@ Property / OpenAlex ID @@
+W1965118588
@@ Property / OpenAlex ID: W1965118588 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3994535
@@ Property / cites work: Q3994535 / rank @@
+Normal rank
@@ Property / cites work @@
+A Group Testing Problem on Two Disjoint Sets
@@ Property / cites work: A Group Testing Problem on Two Disjoint Sets / 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 @@
+A competitive algorithm to find all defective edges in a graph
+Normal rank
@@ Property / cites work @@
+A group testing problem for graphs with several defective edges
+Normal rank
@@ Property / cites work @@
+Sets pooling designs
@@ Property / cites work: Sets pooling designs / rank @@
+Normal rank
@@ Property / cites work @@
+A group testing problem for hypergraphs of bounded rank
+Normal rank
@@ Property / DOI @@
+.1016/J.DAM.2006.07.008
@@ Property / DOI: 10.1016/J.DAM.2006.07.008 / rank @@
+Normal rank