A Group Testing Problem on Two Disjoint Sets
From MaRDI portal
Publication:3964573
DOI10.1137/0602005zbMath0499.05005OpenAlexW2050911484MaRDI QIDQ3964573
Frank K. Hwang, Gerard Jennhwa Chang
Publication date: 1981
Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0602005
Trees (05C05) Factorials, binomial coefficients, combinatorial functions (05A10) Permutations, words, matrices (05A05)
Related Items (17)
Search problems on graphs ⋮ An optimal group testing algorithm on \(k\) disjoint sets ⋮ Determining defectives in a linear order ⋮ Realizability and uniqueness in graphs ⋮ A group testing problem for graphs with several defective edges ⋮ A competitive algorithm in searching for many edges in a hypergraph ⋮ A ternary search problem on graphs ⋮ Group testing with two defectives ⋮ A search problem on graphs which generalizes some group testing problems with two defectives ⋮ A binary search problem on graphs ⋮ Group testing in graphs ⋮ Group testing problem with two defectives ⋮ Quaternary splitting algorithm in group testing ⋮ Edge search in graphs and hypergraphs of bounded rank ⋮ A revised algorithm for searching for all defective edges in a graph ⋮ A tight upper bound for group testing in graphs ⋮ Hypergeometric and Generalized Hypergeometric Group Testing
Cites Work
This page was built for publication: A Group Testing Problem on Two Disjoint Sets
