Learning a hidden subgraph
From MaRDI portal
Recommendations
Cited in
(10)- Structural diagnosis of wiring networks: Finding connected components of unknown subgraphs
- Linear Time Constructions of Some d-Restriction Problems
- scientific article; zbMATH DE number 5957397 (Why is no real title available?)
- Learning unknown graphs
- Non-adaptive group testing on graphs
- Learning a Hidden Matching
- Learning a hidden graph
- Learning a Hidden Subgraph
- Almost tight upper bound for finding Fourier coefficients of bounded pseudo-Boolean functions
- Learning a hidden graph using \(O(\log n)\)queries per edge
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 Q5466454)