A tight upper bound for group testing in graphs (Q1315459): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Search problems on graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Group Testing Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Group Testing Problem on Two Disjoint Sets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Group testing with two defectives / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4163243 / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0166-218x(92)00120-b / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2016519507 / rank | |||
Normal rank |
Latest revision as of 11:26, 30 July 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