A tight upper bound for group testing in graphs
From MaRDI portal
Publication:1315459
DOI10.1016/0166-218X(92)00120-BzbMath0788.05056OpenAlexW2016519507MaRDI QIDQ1315459
Publication date: 15 May 1994
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0166-218x(92)00120-b
Extremal problems in graph theory (05C35) Search theory (90B40) Graph theory (including graph drawing) in computer science (68R10)
Related Items (12)
Realizability and uniqueness in graphs ⋮ A group testing problem for graphs with several defective edges ⋮ A parallel algorithm for nearly optimal edge search ⋮ Edge search in hypergraphs ⋮ A competitive algorithm in searching for many edges in a hypergraph ⋮ A group testing problem for hypergraphs of bounded rank ⋮ Searching for faulty leaves in binary trees ⋮ Group testing in graphs ⋮ A competitive algorithm to find all defective edges in a graph ⋮ A Combinatorial Model of Two-Sided Search ⋮ A revised algorithm for searching for all defective edges in a graph ⋮ Edge search in graphs with restricted test sets
Cites Work
This page was built for publication: A tight upper bound for group testing in graphs
