A revised algorithm for searching for all defective edges in a graph (Q765324): Difference between revisions

@@ 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.2011.08.004
+Normal rank
@@ Property / OpenAlex ID @@
+W2022549516
@@ Property / OpenAlex ID: W2022549516 / 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 @@
+A group testing problem for hypergraphs of bounded rank
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:765324