A group testing problem for hypergraphs of bounded rank

DOI10.1016/0166-218X(95)00120-GzbMath0849.05055OpenAlexW2085062933MaRDI QIDQ1917312

Eberhard Triesch

Publication date: 7 July 1996

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(95)00120-g

zbMATH Keywords

hypergraphprobability distributiongroup testingKraft's inequality

Mathematics Subject Classification ID

Hypergraphs (05C65) Combinatorial probability (60C05)

Related Items (14)

Sparse Solutions of Sparse Linear Systems: Fixed-Parameter Tractability and an Application of Complex Group Testing ⋮ Construction of \(d(H)\)\,-\,disjunct matrix for group testing in hypergraphs ⋮ Randomized group testing for mutually obscuring defectives ⋮ A group testing problem for graphs with several defective edges ⋮ Exact learning from an honest teacher that answers membership queries ⋮ A competitive algorithm in searching for many edges in a hypergraph ⋮ Sparse solutions of sparse linear systems: fixed-parameter tractability and an application of complex group testing ⋮ Searching for faulty leaves in binary trees ⋮ An adaptive algorithm for group testing for complexes ⋮ An Efficient Algorithm for Combinatorial Group Testing ⋮ A competitive algorithm to find all defective edges in a graph ⋮ A Combinatorial Model of Two-Sided Search ⋮ Unnamed Item ⋮ A revised algorithm for searching for all defective edges in a graph

Cites Work

• A tight upper bound for group testing in graphs
• Edge search in hypergraphs
• Edge search in graphs and hypergraphs of bounded rank
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A group testing problem for hypergraphs of bounded rank