A competitive algorithm to find all defective edges in a graph (Q2486071): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.dam.2005.02.010
+Normal rank
@@ Property / OpenAlex ID @@
+W1993987876
@@ Property / OpenAlex ID: W1993987876 / rank @@
+Normal rank
@@ Property / cites work @@
+Search problems on graphs
@@ Property / cites work: Search problems on graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A Group Testing Problem
@@ Property / cites work: A Group Testing Problem / 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 @@
+Q4506360
@@ Property / cites work: Q4506360 / rank @@
+Normal rank
@@ Property / cites work @@
+A group testing problem for graphs with several defective edges
+Normal rank
@@ Property / cites work @@
+A group testing problem for hypergraphs of bounded rank
+Normal rank