Group testing in graphs

DOI10.1007/S10878-007-9068-2MaRDI QIDQ2471072zbMATH OpenOpenAlexFDO

Authors Justie Su-tzu Juan, Gerard Jennhwa Chang

Publication date 18 February 2008

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-007-9068-2

zbMATH Keywords

algorithmbipartite graphsample space

Mathematics Subject Classification ID

Graph theory (05C99) Combinatorial optimization (90C27)

Recommendations

• Group testing in bipartite graphs
• A tight upper bound for group testing in graphs
• On a group testing problem: characterization of graphs with 2-complexity and maximum number of edges
• A group testing problem for graphs with several defective edges
• Edge search in graphs with restricted test sets

Cites work

• A Group Testing Problem
• A Group Testing Problem on Two Disjoint Sets
• A Sequential Method for Screening Experimental Variables
• A tight upper bound for group testing in graphs
• Edge search in graphs and hypergraphs of bounded rank
• Group testing in bipartite graphs
• Group testing with two defectives
• scientific article; zbMATH DE number 3596872 (Why is no real title available?)
• Search problems on graphs

Cited in

(9)

• A binary search problem on graphs
• A tight upper bound for group testing in graphs
• Group testing in bipartite graphs
• A group testing problem for hypergraphs of bounded rank
• Combinatorial group testing in bipartite graphs
• On a group testing problem: characterization of graphs with 2-complexity and maximum number of edges
• Permutation Tests for Infection Graphs
• Equitable induced decompositions of twin graphs
• Optimal quantitative group testing on cycles and paths

This page was built for publication: Group testing in graphs

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