Non-adaptive group testing on graphs

MaRDI QIDQ4560232zbMATH OpenFDO

Authors Hamid Kameli

Publication date 10 December 2018

Full work available at URL https://arxiv.org/abs/1511.09196, https://dmtcs.episciences.org/4351/pdf

zbMATH Keywords

combinatorial searchnon-adaptive algorithmgroup testing on graphslearning a hidden subgraph

Mathematics Subject Classification ID

Applications of graph theory (05C90) Graph algorithms (graph-theoretic aspects) (05C85) Randomized algorithms (68W20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Eulerian and Hamiltonian graphs (05C45)

Recommendations

• A group testing problem for graphs with several defective edges
• Non-adaptive group testing on graphs with connectivity
• Learning a Hidden Subgraph
• A tight upper bound for group testing in graphs
• Automata, Languages and Programming

Cited in

(8)

• Nonadaptive algorithms for threshold group testing
• Group testing in bipartite graphs
• Nonadaptive Group Testing Based on Sparse Pooling Graphs
• An unexpected meeting of four seemingly unrelated problems: graph testing, DNA complex screening, superimposed codes and secure key distribution
• Explicit Nonadaptive Combinatorial Group Testing Schemes
• A revised algorithm for searching for all defective edges in a graph
• Reconstruction of hidden graphs and threshold group testing
• Non-adaptive group testing on graphs with connectivity

This page was built for publication: Non-adaptive group testing on graphs

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