Combinatorial group testing in bipartite graphs

MaRDI QIDQ3565935zbMATH OpenFDO

Authors C. A. Rodger

Publication date 7 June 2010

zbMATH Keywords

bipartitegroup testingsmall degree

Mathematics Subject Classification ID

Other designs, configurations (05B30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Statistical block designs (62K10) Applications of statistics to biology and medical sciences; meta analysis (62P10) Decoding (94B35)

Recommendations

• Group testing in bipartite graphs
• Group testing in graphs
• A group testing problem for graphs with several defective edges
• A tight upper bound for group testing in graphs
• An efficient algorithm for combinatorial group testing

Cited in

(8)

• Group testing in bipartite graphs
• Smart elements in combinatorial group testing problems
• A group testing problem for hypergraphs of bounded rank
• Construction of \(d(H)\)\,-\,disjunct matrix for group testing in hypergraphs
• New combinatorial structures with applications to efficient group testing with inhibitors
• Combinatorial Group Testing for Corruption Localizing Hashing
• scientific article; zbMATH DE number 823957 (Why is no real title available?)
• Sparse Combinatorial Group Testing

This page was built for publication: Combinatorial group testing in bipartite graphs

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