Learning a hidden graph

DOI10.1007/S11590-014-0751-9zbMATH Open1303.90113OpenAlexW2033528221MaRDI QIDQ479267FDOQ479267

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

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

Recommendations

• Learning Theory
• Learning a hidden graph using \(O(\log n)\)queries per edge
• Learning a Hidden Subgraph
• Automata, Languages and Programming
• Learning Theory

zbMATH Keywords

complex modelcombinatorial searchcompetitive group testinggraph learning

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cites Work

• Pooling designs and nonadaptive group testing. Important tools for DNA sequencing.
• Title not available (Why is that?)
• Reconstructing a Hamiltonian cycle by querying the graph: Application to DNA physical mapping
• Title not available (Why is that?)
• Learning a Hidden Matching
• Learning a Hidden Subgraph
• Learning a hidden graph using \(O(\log n)\)queries per edge
• Title not available (Why is that?)
• Improved Results for Competitive Group Testing
• Competitive group testing and learning hidden vertex covers with minimum adaptivity
• On the interval containing at least one prime number
• Bounds for nonadaptive group tests to estimate the amount of defectives
• Title not available (Why is that?)
• Graph-Theoretic Concepts in Computer Science
• Optimal reconstruction of graphs under the additive model
• Reconstruction of hidden graphs and threshold group testing

Cited In (14)

• Learning a hidden uniform hypergraph
• Finding hidden independent sets in interval graphs
• Learning a Hidden Matching
• Automata, Languages and Programming
• Exact learning from an honest teacher that answers membership queries
• Learning Theory
• Learning and Verifying Graphs Using Queries with a Focus on Edge Counting
• Title not available (Why is that?)
• Learning a Hidden Subgraph
• Learning a hidden graph using \(O(\log n)\)queries per edge
• Learning unknown graphs
• Finding hidden independent sets in interval graphs
• Non-adaptive learning of a hidden hypergraph
• Non-adaptive learning of a hidden hypergraph

This page was built for publication: Learning a hidden graph

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