A Group Testing Problem

DOI10.1137/0601004zbMATH Open0499.05004OpenAlexW1973411570MaRDI QIDQ3964572FDOQ3964572

Frank K. Hwang, Gerard Jennhwa Chang

Publication date: 1980

Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0601004

zbMATH Keywords

find defective itemsminimum number of tests

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Factorials, binomial coefficients, combinatorial functions (05A10)

Cited In (7)

• A competitive algorithm to find all defective edges in a graph
• Group testing in graphs
• An optimal group testing algorithm on \(k\) disjoint sets
• Optimal Dorfman group testing for symmetric distributions
• A binary search problem on graphs
• A tight upper bound for group testing in graphs
• Group testing with two defectives

This page was built for publication: A Group Testing Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3964572)