A Group Testing Problem on Two Disjoint Sets
From MaRDI portal
Publication:3964573
DOI10.1137/0602005zbMath0499.05005MaRDI 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
05C05: Trees
05A10: Factorials, binomial coefficients, combinatorial functions
05A05: Permutations, words, matrices
Related Items
A competitive algorithm in searching for many edges in a hypergraph, Search problems on graphs, Determining defectives in a linear order, 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, A tight upper bound for group testing in graphs, Realizability and uniqueness in graphs, A group testing problem for graphs with several defective edges, Edge search in graphs and hypergraphs of bounded rank, An optimal group testing algorithm on \(k\) disjoint sets, Group testing in graphs, Hypergeometric and Generalized Hypergeometric Group Testing
Cites Work