A competitive algorithm in searching for many edges in a hypergraph
From MaRDI portal
Publication:869578
DOI10.1016/j.dam.2006.07.008zbMath1109.68124MaRDI QIDQ869578
Publication date: 8 March 2007
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2006.07.008
68W05: Nonnumerical algorithms
05C65: Hypergraphs
68R10: Graph theory (including graph drawing) in computer science
Related Items
Sparse solutions of sparse linear systems: fixed-parameter tractability and an application of complex group testing, Sparse Solutions of Sparse Linear Systems: Fixed-Parameter Tractability and an Application of Complex Group Testing
Cites Work
- Unnamed Item
- Sets pooling designs
- 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