Recommendations
Cited in
(44)- Nonadaptive algorithms for threshold group testing
- Non-adaptive learning of a hidden hypergraph
- A divide-and-conquer approach for reconstruction of \(\{C_{ \geq 5}\}\)-free graphs via betweenness queries
- Network construction with subgraph connectivity constraints
- Low-weight superimposed codes and related combinatorial structures: bounds and applications
- Lower bounds for cover-free families
- Exact learning from an honest teacher that answers membership queries
- Structural diagnosis of wiring networks: Finding connected components of unknown subgraphs
- Non-adaptive learning of a hidden hypergraph
- Competitive group testing and learning hidden vertex covers with minimum adaptivity
- Finding hidden hubs and dominating sets in sparse graphs by randomized neighborhood queries
- scientific article; zbMATH DE number 5957397 (Why is no real title available?)
- Learning Boolean halfspaces with small weights from membership queries
- Constraining the number of positive responses in adaptive, non-adaptive, and two-stage group testing
- Learning and Verifying Graphs Using Queries with a Focus on Edge Counting
- Reconstructing weighted graphs with minimal query complexity
- Learning unknown graphs
- Non-adaptive group testing on graphs
- Learning a Hidden Matching
- Learning a hidden graph
- Group Testing with Multiple Mutually-Obscuring Positives
- Network construction with ordered constraints
- Automata, Languages and Programming
- A new kind of selectors and their applications to conflict resolution in wireless multichannels networks
- Vector-Matrix-Vector Queries for Solving Linear Algebra, Statistics, and Graph Problems
- On graphs that contain exactly \(k\) copies of a subgraph, and a related problem in search theory
- Bounds and algorithms for generalized superimposed codes
- A tight lower bound on the minimal dispersion
- Almost tight upper bound for finding Fourier coefficients of bounded pseudo-Boolean functions
- Learning a hidden uniform hypergraph
- Lower bounds on the minimal dispersion of point sets via cover-free families
- Improved bounds for group testing in arbitrary hypergraphs
- Lower bounds for graph reconstruction with maximal independent set queries
- Learning spanning forests optimally in weighted undirected graphs with CUT queries
- Learning hypertrees from shortest path queries
- A query algorithm for learning a spanning forest in weighted undirected graphs
- On learning graphs with edge-detecting queries
- Reconstruction of hidden graphs and threshold group testing
- Learning partitions using rank queries
- Finding the diameter of a tree with distance queries
- Ultra-resilient superimposed codes: near-optimal construction and applications
- Reconstructing Markov processes from independent and anonymous experiments
- Learning a hidden graph using \(O(\log n)\)queries per edge
- Optimal query complexity bounds for finding graphs
This page was built for publication: Learning a Hidden Subgraph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5317581)
