scientific article; zbMATH DE number 6991631

zbMATH Open1401.05281arXiv1511.09196MaRDI QIDQ4560232

Hamid Kameli

Publication date: 10 December 2018

Full work available at URL: https://arxiv.org/abs/1511.09196

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

combinatorial searchnon-adaptive algorithmgroup testing on graphslearning a hidden subgraph

Mathematics Subject Classification ID

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

Related Items (4)

Nonadaptive Group Testing Based on Sparse Pooling Graphs ⋮ Nonadaptive algorithms for threshold group testing ⋮ Group testing in bipartite graphs ⋮ Explicit Nonadaptive Combinatorial Group Testing Schemes

This page was built for publication:

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