Learning a hidden uniform hypergraph

DOI10.1007/S11590-017-1131-ZMaRDI QIDQ683922zbMATH OpenOpenAlexFDO

Authors Huilan Chang, Hung-Lin Fu, Chih-Huai Shih

Publication date 9 February 2018

Published in Optimization Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11590-017-1131-z

zbMATH Keywords

group testingadaptive algorithmcomplex modelgraph learning

Mathematics Subject Classification ID

Applications of graph theory (05C90) Protein sequences, DNA sequences (92D20) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph representations (geometric and intersection representations, etc.) (05C62) Hypergraphs (05C65)

Recommendations

• Learning Theory
• scientific article; zbMATH DE number 5957397
• Learning a hidden graph using \(O(\log n)\)queries per edge
• Learning Theory
• Non-adaptive learning of a hidden hypergraph

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?)
• An adaptive algorithm for group testing for complexes
• Graph-Theoretic Concepts in Computer Science
• Learning a Hidden Matching
• Learning a Hidden Subgraph
• Learning a hidden graph
• Learning a hidden graph using \(O(\log n)\)queries per edge
• Optimal reconstruction of graphs under the additive model
• Reconstructing a Hamiltonian cycle by querying the graph: Application to DNA physical mapping
• Sets pooling designs

Cited in

(4)

• Learning Theory
• Learning Theory
• scientific article; zbMATH DE number 5957397 (Why is no real title available?)
• Learning a hidden graph using \(O(\log n)\)queries per edge

This page was built for publication: Learning a hidden uniform hypergraph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q683922)