A revised algorithm for searching for all defective edges in a graph
From MaRDI portal
Publication:765324
DOI10.1016/j.dam.2011.08.004zbMath1237.05198OpenAlexW2022549516MaRDI QIDQ765324
Publication date: 19 March 2012
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2011.08.004
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Cites Work
- Unnamed Item
- Competitive group testing
- A tight upper bound for group testing in graphs
- A group testing problem for graphs with several defective edges
- A group testing problem for hypergraphs of bounded rank
- A competitive algorithm to find all defective edges in a graph
- A Group Testing Problem on Two Disjoint Sets