Learning a hidden graph

DOI10.1007/s11590-014-0751-9zbMath1303.90113OpenAlexW2033528221MaRDI QIDQ479267

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

Publication date: 5 December 2014

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-014-0751-9

zbMATH Keywords

complex modelcombinatorial searchcompetitive group testinggraph learning

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items

Exact learning from an honest teacher that answers membership queries, Non-adaptive learning of a hidden hypergraph, Learning a hidden uniform hypergraph, Non-adaptive Learning of a Hidden Hypergraph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reconstruction of hidden graphs and threshold group testing
• Learning a hidden graph using \(O(\log n)\)queries per edge
• Reconstructing a Hamiltonian cycle by querying the graph: Application to DNA physical mapping
• BOUNDS FOR NONADAPTIVE GROUP TESTS TO ESTIMATE THE AMOUNT OF DEFECTIVES
• COMPETITIVE GROUP TESTING AND LEARNING HIDDEN VERTEX COVERS WITH MINIMUM ADAPTIVITY
• Learning a Hidden Matching
• Improved Results for Competitive Group Testing
• Learning a Hidden Subgraph
• On the interval containing at least one prime number
• Graph-Theoretic Concepts in Computer Science
• Optimal reconstruction of graphs under the additive model