Abstract
We consider the problem of learning a labeled graph from a given family of graphs on n vertices in a model where the only allowed operation is to query whether a set of vertices induces an edge. Questions of this type are motivated by problems in molecular biology. In the deterministic nonadaptive setting, we prove nearly matching upper and lower bounds for the minimum possible number of queries required when the family is the family of all stars of a given size or all cliques of a given size. We further describe some bounds that apply to general graphs.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alon, N., Beigel, R., Kasif, S., Rudich, S., Sudakov, B.: Learning a Hidden Matching. In: Proceedings of the 43rd IEEE FOCS 2002, pp. 197–206 (2002)
Alon, N., Spencer, J.H.: The Probabilistic Method, 2nd edn. Wiley, New York (2000)
Bollobás, B.: Random Graphs. Academic Press, London (1985)
Dyachkov, G., Rykov, V.V.: Bounds on the Length of Disjunctive Codes. Problemy Peredachi Informatsii 18(3), 158–166 (1982)
Grebinski, V., Kucherov, G.: Optimal Query Bounds for Reconstructing a Hamiltonian Cycle in Complete Graphs. In: Proc. 5th Israeli Symposium on Theoretical Computer Science, pp. 166–173 (1997)
Grebinski, V., Kucherov, G.: Reconstructing a Hamiltonian Cycle by Querying the Graph: Application to DNA Physical Mapping. Discrete Applied Math. 88, 147–165 (1998)
Grebinski, V., Kucherov, G.: Optimal Reconstruction of Graphs under the Additive Model. Algorithmica 28(1), 104–124 (2000)
Ruszinkó, M.: On the Upper Bound of the size of the r-cover-free families. Journal of Combinatorial Theory Series A 66(2), 302–310 (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Alon, N., Asodi, V. (2004). Learning a Hidden Subgraph. In: DÃaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds) Automata, Languages and Programming. ICALP 2004. Lecture Notes in Computer Science, vol 3142. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27836-8_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-27836-8_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22849-3
Online ISBN: 978-3-540-27836-8
eBook Packages: Springer Book Archive