2 research outputs found
On Multistage Learning a Hidden Hypergraph
Learning a hidden hypergraph is a natural generalization of the classical
group testing problem that consists in detecting unknown hypergraph
by carrying out edge-detecting tests. In the given paper we
focus our attention only on a specific family of localized
hypergraphs for which the total number of vertices , the number of
edges , , and the cardinality of any edge ,
. Our goal is to identify all edges of by
using the minimal number of tests. We develop an adaptive algorithm that
matches the information theory bound, i.e., the total number of tests of the
algorithm in the worst case is at most . We also discuss
a probabilistic generalization of the problem.Comment: 5 pages, IEEE conferenc