Learning a Hidden Subgraph
暂无分享,去创建一个
[1] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.
[2] Miklós Ruszinkó,et al. On the upper bound of the size of the r -cover-free families , 1994 .
[3] Béla Bollobás,et al. Random Graphs , 1985 .
[4] Vladimir Grebinski,et al. Reconstructing a Hamiltonian Cycle by Querying the Graph: Application to DNA Physical Mapping , 1998, Discret. Appl. Math..
[5] Noga Alon,et al. Learning a Hidden Matching , 2004, SIAM J. Comput..
[6] Vladimir Grebinski,et al. Optimal Reconstruction of Graphs under the Additive Model , 2000, Algorithmica.
[7] Vladimir Grebinski,et al. Optimal query bounds for reconstructing a Hamiltonian cycle in complete graphs , 1997, Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems.
[8] Noga Alon,et al. The Probabilistic Method, Second Edition , 2004 .