Learning a bounded-degree tree using separator queries

DOI10.1007/978-3-642-40935-6_14MaRDI QIDQ2859217zbMATH OpenOpenAlexFDO

Authors M. Jagadish, Anindya Sen

Publication date 6 November 2013

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-40935-6_14

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational learning theory (68Q32)

Recommendations

• Learning Theory
• Optimal reconstruction of graphs under the additive model
• scientific article; zbMATH DE number 1754590
• Learning a hidden graph using \(O(\log n)\)queries per edge
• On the hardness of learning queries from tree structured data

Cited in

(6)

• On the hardness of learning queries from tree structured data
• scientific article; zbMATH DE number 7626718 (Why is no real title available?)
• scientific article; zbMATH DE number 7651142 (Why is no real title available?)
• Exact learning of multitrees and almost-trees using path queries
• Exact learning of weighted graphs using composite queries
• An optimal algorithm for sorting in trees

This page was built for publication: Learning a bounded-degree tree using separator queries

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