Recommendations
Cites work
- scientific article; zbMATH DE number 5957397 (Why is no real title available?)
- scientific article; zbMATH DE number 41347 (Why is no real title available?)
- scientific article; zbMATH DE number 45817 (Why is no real title available?)
- scientific article; zbMATH DE number 1508646 (Why is no real title available?)
- Bounds for nonadaptive group tests to estimate the amount of defectives
- Competitive group testing and learning hidden vertex covers with minimum adaptivity
- Graph-Theoretic Concepts in Computer Science
- Improved Results for Competitive Group Testing
- Learning a Hidden Matching
- Learning a Hidden Subgraph
- Learning a hidden graph using \(O(\log n)\)queries per edge
- On the interval containing at least one prime number
- Optimal reconstruction of graphs under the additive model
- Pooling designs and nonadaptive group testing. Important tools for DNA sequencing.
- Reconstructing a Hamiltonian cycle by querying the graph: Application to DNA physical mapping
- Reconstruction of hidden graphs and threshold group testing
Cited in
(14)- Learning a hidden uniform hypergraph
- Finding hidden independent sets in interval graphs
- Learning a Hidden Matching
- Automata, Languages and Programming
- Exact learning from an honest teacher that answers membership queries
- Learning Theory
- Learning and Verifying Graphs Using Queries with a Focus on Edge Counting
- scientific article; zbMATH DE number 5957397 (Why is no real title available?)
- Learning a Hidden Subgraph
- Learning a hidden graph using \(O(\log n)\)queries per edge
- Learning unknown graphs
- Finding hidden independent sets in interval graphs
- Non-adaptive learning of a hidden hypergraph
- Non-adaptive learning of a hidden hypergraph
This page was built for publication: Learning a hidden graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q479267)
