A Group Testing Problem

DOI10.1137/0601004MaRDI QIDQ3964572zbMATH OpenOpenAlexFDO

Authors Gerard Jennhwa Chang, Frank K. Hwang

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

(8)

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

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)