Learning a hidden uniform hypergraph

DOI10.1007/S11590-017-1131-ZzbMath1382.05049OpenAlexW2603246571MaRDI QIDQ683922

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

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

adaptive algorithmgroup testingcomplex modelgraph learning

Mathematics Subject Classification ID

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

Cites Work

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

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