A tight upper bound for group testing in graphs (Q1315459): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 12:57, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A tight upper bound for group testing in graphs |
scientific article |
Statements
A tight upper bound for group testing in graphs (English)
0 references
15 May 1994
0 references
group testing
0 references
upper bound
0 references
efficient algorithm
0 references
