A Group Testing Problem on Two Disjoint Sets

DOI10.1137/0602005zbMATH Open0499.05005OpenAlexW2050911484MaRDI QIDQ3964573FDOQ3964573

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

zbMATH Keywords

rooted binary treefind defective itemsminimum number of tests

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)

Cited In (18)

• Hypergeometric and Generalized Hypergeometric Group Testing
• A competitive algorithm in searching for many edges in a hypergraph
• Search problems on graphs
• A group testing problem for graphs with several defective edges
• A ternary search problem on graphs
• Realizability and uniqueness in graphs
• Group testing in graphs
• Quaternary splitting algorithm in group testing
• Group testing problem with two defectives
• An optimal group testing algorithm on \(k\) disjoint sets
• Optimal Dorfman group testing for symmetric distributions
• Edge search in graphs and hypergraphs of bounded rank
• A revised algorithm for searching for all defective edges in a graph
• A search problem on graphs which generalizes some group testing problems with two defectives
• A binary search problem on graphs
• A tight upper bound for group testing in graphs
• Determining defectives in a linear order
• Group testing with two defectives

This page was built for publication: A Group Testing Problem on Two Disjoint Sets

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