A tight upper bound for group testing in graphs
- 26 January 1994
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 48 (2) , 101-109
- https://doi.org/10.1016/0166-218x(92)00120-b
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Edge search in graphs and hypergraphs of bounded rankDiscrete Mathematics, 1993
- Search problems on graphsDiscrete Applied Mathematics, 1986
- Group testing with two defectivesDiscrete Applied Mathematics, 1982
- A Group Testing Problem on Two Disjoint SetsSIAM Journal on Algebraic Discrete Methods, 1981
- A Group Testing ProblemSIAM Journal on Algebraic Discrete Methods, 1980