Learning a hidden subgraph

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3142, Issue , 2004, Pages 110-121

  Alon, Noga ^a   Asodi, Vera ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

GENERAL GRAPH; LABELED GRAPHS; SUBGRAPHS; UPPER AND LOWER BOUNDS;

MOLECULAR BIOLOGY;

EID: 35048836560     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27836-8_12     Document Type: Article

References (8)

1. N. Alon, R. Beigel, S. Kasif, S. Rudich, B. Sudakov, Learning a Hidden Matching, Proceedings of the 43rd IEEE FOCS, 2002, 197-206.
2. N. Alon and J. H. Spencer, The Probabilistic Method, Second Edition, Wiley, New York, 2000.
3. B. Bollobás, Random Graphs, Academic Press, 1985.
4. A. G. Dyachkov and V. V. Rykov, Bounds on the Length of Disjunctive Codes, Problemy Peredachi Informatsii Vol. 18, no. 3 (1982), 158-166.
5. V. Grebinski and G. Kucherov, Optimal Query Bounds for Reconstructing a Hamiltonian Cycle in Complete Graphs, Proc. 5th Israeli Symposium on Theoretical Computer Science (1997), 166-173.
6. V. Grebinski and G. Kucherov, Reconstructing a Hamiltonian Cycle by Querying the Graph: Application to DNA Physical Mapping, Discrete Applied Math. 88 (1998), 147-165.
7. V. Grebinski and G. Kucherov, Optimal Reconstruction of Graphs under the Additive Model, Algorithmica 28(1) (2000), 104-124.
8. M. Ruszinkó, On the Upper Bound of the size of the r-cover-free families, Journal of Combinatorial Theory Series A vol. 66, no. 2, May 1994, 302-310.