Optimal reconstruction of graphs under the additive model

Algorithmica (New York)

Volumn 28, Issue 1, 2000, Pages 104-124

  Grebinski, V ^a   Kucherov, G ^a  

^a LORIA   (France)

Author keywords

Coin weighing; Combinatorial search; Graph reconstruction; Nonadaptive algorithms

Indexed keywords

EID: 1842658828     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004530010033     Document Type: Article

References (21)

1. A. Aggarwal, D. Coppersmith, and D. Kleitman. A generalized model for understanding evasiveness. Information Processing Letters, 30:205-208, 1989.
2. M. Aigner. Search problems on graphs. Discrete Applied Mathematics, 14:215-230, 1986.
3. M. Aigner. Combinatorial Search. Wiley, New York, 1988.
4. N. Alon. Separating matrices. Private communication, May 1997.
5. N. Alon and J. H. Spencer. The Probabilistic Method. With an Appendix on Open Problems by Paul Erdos. Series in Discrete Mathematics and Optimization. Wiley-Interscience, New York, 1992.
6. I. Anderson. Combinatorics of Finite Sets. Clarendon Press, Oxford, 1989.
7. P.J. Cameron. Combinatorics: Topics, Techniques, Algorithms. Cambridge University Press, Cambridge, 1994.
8. D.-Z. Du and F. K. Hwang. Combinatorial Group Testing and Its Applications, Series on Applied Mathematics, volume 3. World Scientific, Singapore, 1993.
9. P. Erdos and J. Spencer. Probabilistic Methods in Combinatorics. Akademiai Kiado, Budapest, 1974.
10. L. Gargano, V. Montuori, G. Setaro, and U. Vaccaro. An improved algorithm for quantitative group testing. Discrete Applied Mathematics, 36:299-306, 1992.
11. O. Goldreich, S. Goldwasser, and D. Ron. Property testing and its connection to learning and approximation. In Proceedings of the 37th Annual Symposium on Foundations of Computer Science, pages 339-348, 1996.
12. O. Goldreich and D. Ron. Property testing in bounded degree graphs. In Proceedings of the 29th Annual ACM Symposium on Theory of Computing, pages 406-415, 1997.
13. V. Grebinski. On the power of additive combinatorial search model. In Proceedings of the Fourth Annual International Computing and Combinatorics Conference (COCOON 98), pages 194-203. LNCS, volume 1449. Springer-Verlag, Berlin, 1998.
14. 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, pages 166-173. IEEE Press, New York, 1997.
15. F. H. Hao. The optimal procedures for quantitative group testing. Discrete Applied Mathematics, 26:79-86.
16. V. Koubek and J. Rajlich. Combinatorics of separation by binary matrices. Discrete Mathematics, 57:203-208, 1985.
17. B. Lindström. On a combinatorial problem in number theory. Canadian Mathematical Bulletin, 8:477-490, 1965.
18. B. Lindström. On Möbius functions and a problem in combinatorial number theory. Canadian Mathematical Bulletin, 14(4):513-516, 1971.
19. 2-sequences of vectors. Journal of Number Theory, 4:261-265, 1972.
20. B. Lindström. Determining subsets by unramified experiments. In J. N. Srivastava, editor, A Survey of Statistical Designs and Linear Models, pages 407-418. North-Holland, Amsterdam, 1975.
21. R. L. Rivest and J. Vuillemin. On reconstructing graph properties from adjacency matrices. Theoretical Computer Science, 3:371-384, 1976.