Reconstruction of hidden graphs and threshold group testing-Reference-Cited by-同舟云学术

Reconstruction of hidden graphs and threshold group testing

Published:2010-01-30 Issue:2 Volume:22 Page:270-281
ISSN:1382-6905
Container-title:Journal of Combinatorial Optimization
language:en
Short-container-title:J Comb Optim

Author:

Chang Huilan,Chen Hong-Bin,Fu Hung-Lin,Shi Chie-Huai

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications

Link

http://link.springer.com/content/pdf/10.1007/s10878-010-9291-0.pdf

Reference16 articles.

1. Aigner M (1988) Combinatorial search. Wiley, New York

2. Alon N, Asodi V (2005) Learning a hidden subgraph. SIAM J Discrete Math 18:697–712

3. Alon N, Beigel R Kasif S, Rudich S, Sudakov B (2004) Learning a hidden matching. SIAM J Comput 33:487–501

4. Anderson I (1990) Combinatorial designs: construction methods. Ellis Horwood, Chichester

5. Angluin D, Chen J (2006) Learning a hidden hypergraph. J Mach Learn Res 7:2215–2236

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Efficiently Decodable Non-Adaptive Threshold Group Testing;IEEE Transactions on Information Theory;2019-09

2. Exact learning from an honest teacher that answers membership queries;Theoretical Computer Science;2018-07

3. Non-adaptive learning of a hidden hypergraph;Theoretical Computer Science;2018-03

4. Non-adaptive Learning of a Hidden Hypergraph;Lecture Notes in Computer Science;2015

5. Linear Time Constructions of Some $$d$$ -Restriction Problems;Lecture Notes in Computer Science;2015