On a group testing problem: characterization of graphs with 2-complexity and maximum number of edges

DOI10.1016/J.DAM.2011.06.026MaRDI QIDQ411849zbMATH OpenOpenAlexFDO

Authors Tatjana Gerzen

Publication date 30 April 2012

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2011.06.026

zbMATH Keywords

combinatorial searchgroup testing problem

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62) 2-person games (91A05)

Recommendations

• Searching for an edge in a graph with restricted test sets
• A search problem on graphs which generalizes some group testing problems with two defectives
• A tight upper bound for group testing in graphs
• An NP-completeness result of edge search in graphs
• Group testing in graphs

Cites work

• A probabilistic upper bound for the edge identification complexity of graphs
• Competitive group testing
• Edge search in graphs with restricted test sets
• scientific article; zbMATH DE number 3662840 (Why is no real title available?)
• scientific article; zbMATH DE number 15129 (Why is no real title available?)
• scientific article; zbMATH DE number 41347 (Why is no real title available?)
• scientific article; zbMATH DE number 1179517 (Why is no real title available?)
• scientific article; zbMATH DE number 2141600 (Why is no real title available?)
• Pooling designs and nonadaptive group testing. Important tools for DNA sequencing.
• Searching for an edge in a graph with restricted test sets

Cited in

(7)

• Searching for an edge in a graph with restricted test sets
• Edge search in graphs with restricted test sets
• A search problem on graphs which generalizes some group testing problems with two defectives
• A group testing problem for graphs with several defective edges
• An NP-completeness result of edge search in graphs
• Group testing in graphs
• scientific article; zbMATH DE number 25604 (Why is no real title available?)

This page was built for publication: On a group testing problem: characterization of graphs with 2-complexity and maximum number of edges

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