Optimal reconstruction of graphs under the additive model

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

Volumn 1284, Issue , 1997, Pages 248-258

  Grebinski, Vladimir ^a   Kucherov, Gregory ^a  

^a INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ADDITIVES; INFORMATION THEORY;

ADAPTIVE SOLUTION; ADDITIVE MODELS; BOUNDED DEGREE GRAPHS; COMBINATORIAL SEARCH; GENERAL GRAPH; INFORMATION-THEORETIC LOWER BOUNDS; UPPER BOUND;

GRAPHIC METHODS;

EID: 84949223384     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63397-9_19     Document Type: Conference Paper

References (18)

1. Martin Aigner. Search problems on graphs. Discrete Applied Mathematics, 14:215-230, 1986.
2. Martin Aigner. Combinatorial Search. John Wiley & Sons, 1988.
3. Noga Alon. Separating matrices, private communication, May 1997.
4. Noga Alon and Joel Spencer. The Probabilistic Method. Wiley Interscience, New York, 1992.
5. Peter J. Cameron. Combinatorics: Topics, Techniques, Algorithms. Cambridge University Press, 1994.
6. Ding-Zhu Du and Frank K. Hwang. Combinatorial Group Testing and its applications, volume 3 of Series on applied mathematics. World Scientific, 1993.
7. L. Gargano, V. Montuori, G. Setaro, and U. Vaccaro. An improved algorithm for quantitive group testing. Discrete Applied Mathematics, 36:299-306, 1992.
8. Oded Goldreich, Shaft Goldwasser, and Dana Ron. Property testing and its connection to learning and approximation. In Proceedings of the 37th Annual Symposium on Founations of Computer Scince, pages 339-348, 1996.
9. Oded Goldreich and Dana Ron. Property testing in bounded degree graphs. In The 29th Annual ACM Symposium on Theory of Computing, 1997. to appear. Full version available at http://theory.lcs.mit.edu/~danar/papers.htnil.
10. Vladimir Grebinski and Gregory 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 Press, June 1997. to appear.
11. Vladimir Grebinski and Gregory Kucherov. Optimal reconstruction of graphs under the additive model. Rapport de Recherche 3171, INRIA, Mai 1997.
12. Fred H. Hao. The optimal procedures for quantitive group testing. Discrete Applied Mathematics, 26:79-86, 1990.
13. V. Koubek and J. Rajlich. Combinatorics of separation by binary matrices. Discrete Mathematics, 57:203-208, 1985.
14. Bernt Lindström. On a combinatorial problem in number theory. Canad. Math. Bull., 8:477-490, 1965.
15. Bernt Lindström. On Mobius functions and a problem in combinatorial number theory. Canad. Math. Bull., 14(4):513-516, 1971.
16. 2-sequences of vectors. Journal of Number Theory, 4:261-265, 1972.
17. Bernt 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.
18. R.L. Rivest and J. Vuilemin. On reconstructing graph properties from adjacency matrices. Theoretical Computer Science, 3:371-384, 1976.