Edge search in graphs with restricted test sets
From MaRDI portal
Publication:1045083
DOI10.1016/j.disc.2009.04.013zbMath1181.68174OpenAlexW1998478634MaRDI QIDQ1045083
Publication date: 15 December 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2009.04.013
Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
On a group testing problem: characterization of graphs with 2-complexity and maximum number of edges ⋮ An NP-completeness result of edge search in graphs
Cites Work
- Searching for an edge in a graph with restricted test sets
- Competitive group testing
- A tight upper bound for group testing in graphs
- A probabilistic upper bound for the edge identification complexity of graphs
- A Method for Detecting All Defective Members in a Population by Group Testing
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item