Learning a hidden subgraph

SIAM Journal on Discrete Mathematics

Volumn 18, Issue 4, 2005, Pages 697-712

  Alon, Noga ^a   Asodi, Vera ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Complete graphs; Hidden subgraphs; Stars

Indexed keywords

GRAPH THEORY; MOLECULAR BIOLOGY;

COMPLETE GRAPHS; HIDDEN SUBGRAPHS; STARS;

PROBLEM SOLVING;

EID: 27144531541     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480103431071     Document Type: Article

References (8)

1. N. ALON, R. BEIGEL, S. KASIF, S. RUDICH, AND B. SUDAKOV, Learning a hidden matching, SIAM J. Comput., 33 (2004), pp. 487-501.
2. N. ALON AND J. H. SPENCER, The Probabilistic Method, 2nd ed., Wiley, New York, 2000.
3. B. BOLLOBÁS, Random Graphs, Academic Press, London, 1985.
4. A. G. DYACHKOV AND V. V. RYKOV, Bounds on the length of disjunctive codes, Problemy Peredachi Informatsii, 18 (1982), pp. 158-166.
5. V. GREBINSKI AND G. KUCHEROV, Optimal query bounds for reconstructing a Hamiltonian cycle in complete graphs, in Proceedings of the 5th Israeli Symposium on Theory of Computing and Systems, IEEE Computer Society, 1997, pp. 166-173.
6. V. GREBINSKI AND G. KUCHEROV, Reconstructing a Hamiltonian cycle by querying the graph: Application to DNA physical mapping, Discrete Appl. Math., 88 (1998), pp. 147-165.
7. V. GREBINSKI AND G. KUCHEROV, Optimal reconstruction of graphs under the additive model, Algorithmica, 28 (2000), pp. 104-124.
8. M. RUSZINKÓ, On the upper bound of the size of the r-cover-free families, J. Combin. Theory Ser. A, 66 (1994), pp. 302-310.