. [. Bibliographie, J. Arnborg, D. Lagergren, and . Seese, Easy Problems for Tree- Decomposable Graphs, Journal of Algorithms, vol.12, issue.2, pp.308-340, 1991.

J. [. Alon and . Spencer, The Probabilistic Method, 2000.

I. [. Bertrand, O. Charon, A. Hudry, and . Lobstein, Identifying and locating-dominating codes on chains and cycles, European Journal of Combinatorics, vol.25, issue.7, pp.969-987, 2004.
DOI : 10.1016/j.ejc.2003.12.013

]. E. Ber68 and . Berlekamp, Block Coding for the Binary Symmetric Channel with Noiseless, Delayless Feedback, Error- Correcting Codes, pp.61-85, 1968.

D. Babi´cbabi´c, A. Graovac, B. Mohar, and T. Pisanski, The matching polynomial of a polygraph, Discrete Applied Mathematics, vol.15, issue.1, pp.11-24, 1986.
DOI : 10.1016/0166-218X(86)90014-4

U. Blass, I. Honkala, and S. Litsyn, On binary codes for identification, Journal of Combinatorial Designs, vol.69, issue.2, pp.151-156, 2000.
DOI : 10.1002/(SICI)1520-6610(2000)8:2<151::AID-JCD8>3.0.CO;2-S

U. Blass, I. Honkala, and S. Litsyn, Bounds on identifying codes, Bounds on Identifying Codes, pp.119-128, 2001.
DOI : 10.1016/S0012-365X(01)00113-3

J. [. Bale, J. Litt, and . Pavelin, The AMT DAP 500 system, 1990.

]. H. Bod93 and . Bodlaender, A Tourist Guide through Treewidth, Acta Cybernetica, vol.11, issue.12, pp.1-21, 1993.

]. B. Bol82 and . Bollobás, Distinguishing Vertices of Random Graphs, Annals of Discrete Mathematics, vol.13, pp.33-50, 1982.

I. Charon, I. Honkala, O. Hudry, and A. Lobstein, General Bounds for Identifying Codes in some Infinite Regular Graphs, Electronic Journal of Combinatorics, vol.8, issue.1, p.39, 2001.

I. [. Charon, O. Honkala, A. Hudry, and . Lobstein, The minimum density of an identifying code in the king lattice, Discrete Mathematics, vol.276, issue.1-3, pp.95-109, 2004.
DOI : 10.1016/S0012-365X(03)00306-6

]. I. Chl02a, O. Charon, A. Hudry, and . Lobstein, Identifying Codes with Small Radius in some Infinite Regular Graphs, Electronic Journal of Combinatorics, vol.9, issue.1, p.11, 2002.

]. I. Chl02b, O. Charon, A. Hudry, and . Lobstein, Identifying and Locating- Dominating Codes : NP-completeness Results for Directed Graphs, IEEE Transactions on Information Theory, vol.48, issue.8, pp.2192-2200, 2002.

I. Charon, O. Hudry, and A. Lobstein, Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard, Theoretical Computer Science, vol.290, issue.3, pp.2109-2120, 2003.
DOI : 10.1016/S0304-3975(02)00536-4

I. Charon, O. Hudry, and A. Lobstein, Extremal cardinalities for identifying and locating-dominating codes in graphs, Discrete Mathematics, vol.307, issue.3-5
DOI : 10.1016/j.disc.2005.09.027

I. Charon, O. Hudry, and A. Lobstein, Possible Cardinalities for Identifying Codes in Graphs, Australasian Journal of Combinatorics

R. [. Chung and . Graham, Erd? os on Graphs ? His Legacy of Unsolved Problems, 1998.

S. [. Charon, O. Gravier, A. Hudry, M. Lobstein, and J. Mollard, A linear algorithm for minimum 1-identifying codes in oriented trees, Discrete Applied Mathematics, vol.154, issue.8
DOI : 10.1016/j.dam.2005.11.007

URL : https://hal.archives-ouvertes.fr/hal-00360156

S. [. Cohen, I. Gravier, A. Honkala, M. Lobstein, C. Mollard et al., Improved Identifying Codes for the Grid, Electronic Journal of Combinatorics, issue.61, p.19, 1999.

I. [. Cohen, A. Honkala, G. Lobstein, and . Zémor, New Bounds for Codes Identifying Vertices in Graphs, Electronic Journal of Combinatorics, vol.6, issue.1, p.19, 1999.

M. Cs?-urös and A. Milosavljevic, Pooled Genomic Indexing (PGI): Mathematical Analysis and Experiment Design, Lecture Notes in Computer Science, vol.2452, pp.10-28, 2002.
DOI : 10.1007/3-540-45784-4_2

A. [. Cs?-urös and . Milosavljevic, Pooled Genomic Indexing (PGI): Analysis and Design of Experiments, Journal of Computational Biology, vol.11, issue.5, pp.1001-1021, 2004.
DOI : 10.1089/cmb.2004.11.1001

P. [. Colbourn, L. K. Slater, and . Stewart, Locating Dominating Sets in Series Parallel Networks, Congressus Numerantium, vol.56, pp.135-162, 1987.

S. [. Daniel and J. Gravier, Identifying codes in some subgraphs of the square lattice, Theoretical Computer Science, vol.319, issue.1-3, pp.411-421, 2004.
DOI : 10.1016/j.tcs.2004.02.007

V. [. D-'yachkov and . Rykov, Optimal superimposed codes and designs for Renyi's search model, Journal of Statistical Planning and Inference, vol.100, issue.2, pp.281-302, 2002.
DOI : 10.1016/S0378-3758(01)00140-9

L. [. Erd?-os and . Lovász, Problems and Results on 3-chromatic Hypergraphs and some Related Questions, Infinite and Finite Sets, pp.609-627, 1975.

A. [. Erd?-os and . Rényi, On the Evolution of Random Graphs, Publications of the, Mathematical Institute of the Hungarian Academy of Sciences, vol.5, pp.17-61, 1960.

A. [. Erd?-os and . Rényi, On the Evolution of Random Graphs, Bulletin de l'Institut International de Statistique, pp.343-347, 1961.

P. Erd?-os, Beweis eines Satzes von Tschebyschef, Acta Litterarum ac Scientiarum, Szeged, vol.5, pp.194-198, 1932.

R. Fagin, Probabilities on finite models, The Journal of Symbolic Logic, vol.23, issue.01, pp.50-58, 1976.
DOI : 10.1007/BF02759729

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

]. Z. Fur96 and . Füredi, On r-cover free Families, Journal of Combinatorial Theory Series A, vol.73, issue.1, pp.172-173, 1996.

D. [. Garey and . Johnson, Computers and Intractability : A Guide to the Theory of NP-completeness, 1979.

J. [. Gravier, Construction of Codes Identifying Sets of Vertices, Electronic Journal of Combinatorics, vol.12, issue.1, p.13, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00360014

. S. Gm and J. Gravier, On Graphs Having a V {x} Set as an Identifying Code

. S. Gmp, J. Gravier, C. Moncel, and . Payan, A Generalization of the Pentomino Exclusion Problem : the ?-Dislocation in Graphs

. S. Gms, J. Gravier, A. Moncel, and . Semri, Identifying Codes of Cycles, Gol94] S. W. Golomb, Polyominoes : Puzzles, Patterns, Problems, and Packings, 1994.

]. W. Hil85 and . Hillis, The Connection Machine, 1985.

M. [. Honkala, S. Karpovsky, and . Litsyn, On the Identification of Vertices and Edges Using Cycles, Lecture Notes in Computer Science, vol.2227, pp.308-314, 2001.
DOI : 10.1007/3-540-45624-4_32

M. [. Honkala, S. Karpovsky, and . Litsyn, Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori, Discrete Applied Mathematics, vol.129, issue.2-3, pp.409-419, 2003.
DOI : 10.1016/S0166-218X(02)00579-6

I. Honkala and A. Lobstein, On the complexity of the identification problem in Hamming spaces, Acta Informatica, vol.38, issue.11-12, pp.839-845, 2002.
DOI : 10.1007/s00236-002-0093-4

I. Honkala and A. Lobstein, On the Density of Identifying Codes in the Square Lattice, Journal of Combinatorial Theory, Series B, vol.85, issue.2, pp.297-306, 2002.
DOI : 10.1006/jctb.2001.2106

]. I. Hl02c, A. Honkala, and . Lobstein, On Identifying Codes in Binary Hamming Spaces, Journal of Combinatorial Theory Series A, vol.99, pp.232-243, 2002.

]. I. Hl03a, T. Honkala, and . Laihonen, On the Identification of Sets of Points in the Square Lattice, Discrete and Computational Geometry, vol.29, pp.139-152, 2003.

I. Honkala and A. Lobstein, On Identification in Z 2 Using Translates of Given Patterns, Journal of Universal Computer Science, vol.9, issue.10, pp.1204-1219, 2003.

T. [. Honkala, S. Laihonen, and . Ranto, On Codes Identifying Sets of Vertices in Hamming Spaces, Designs, Codes and Cryptography, vol.24, issue.2, pp.193-204, 2001.
DOI : 10.1023/A:1011256721935

T. [. Honkala, S. Laihonen, and . Ranto, On strongly identifying codes, Discrete Mathematics, vol.254, issue.1-3, pp.191-205, 2002.
DOI : 10.1016/S0012-365X(01)00357-0

R. [. Harary and . Melter, On the Metric Dimension of a Graph, Ars Combinatoria, vol.2, pp.191-195, 1976.

V. [. Hwang and . Sós, Non-adaptive Hypergeometric Group Testing, Studia Scientiarum Mathematicarum Hungaricae, vol.22, issue.1-4, pp.257-263, 1987.

]. S. Jan98 and . Janson, New Versions of Suen's Correlation Inequality, Random Structures Algorithms, vol.13, issue.3-4, pp.467-483, 1998.

B. [. Juvan, A. Mohar, S. Graovac, J. Klav?ar, and . Zerovnik, Fast computation of the Wiener index of fasciagraphs and rotagraphs, Journal of Chemical Information and Modeling, vol.35, issue.5, pp.834-840, 1995.
DOI : 10.1021/ci00027a007

M. Juvan, B. Mohar, J. G. Zerovnik-[-kcl98-]-m, K. Karpovsky, L. B. Chakrabarty et al., Distance-related invariants on polygraphs, On the Covering of Vertices for Fault Diagnosis in Hypercubes, Information Processing Letters, pp.57-71, 1997.
DOI : 10.1016/S0166-218X(97)00069-3

]. A. Kog95 and . Kogan, On the Essential Test Sets of Discrete Matrices Nonrandom Binary Superimposed Codes, Discrete Applied Mathematics IEEE Transactions on Information Theory, vol.60, issue.10, pp.249-255, 1964.

A. [. Klav?ar and . Vesel, Computing graph invariants on rotagraphs using dynamic algorithm approach: the case of (2,1)-colorings and independence numbers, Discrete Applied Mathematics, vol.129, issue.2-3, pp.449-460, 2003.
DOI : 10.1016/S0166-218X(02)00597-8

A. [. Klav?ar and . Zerovnik, Algebraic approach to fasciagraphs and rotagraphs, Sequences of Optimal Identifying CodesLai02b] T. Laihonen, Optimal codes for strong identification, pp.93-100, 1996.
DOI : 10.1016/0166-218X(95)00058-Y

. S. Lm, Y. Litsyn, and . Merksamer, Exact Minimum Density of Codes Identifying Vertices in the Square Grid , soumis, Lov98] L. Lovász, One Mathematics, pp.10-15, 1998.

S. [. Laihonen and . Ranto, Codes Identifying Sets of Vertices, LR02] T. Laihonen, S. Ranto, Families of Optimal Codes for Strong Identification, pp.82-911, 2001.
DOI : 10.1007/3-540-45624-4_9

URL : https://hal.archives-ouvertes.fr/hal-00182323

Q. [. Livingston and . Stout, Constant Time Computation of Minimum Dominating Sets, Congressus Numerantium, vol.105, pp.116-128, 1994.

D. [. Payne and . Preece, Identification Keys and Diagnostic Tables: A Review, Journal of the Royal Statistical Society. Series A (General), vol.143, issue.3, pp.143-253, 1980.
DOI : 10.2307/2982129

]. S. Ram19 and . Ramanujan, A Proof of Bertrand's Postulate, Journal of the Indian Mathematical Society, vol.11, pp.181-182, 1919.

]. A. Ren62 and . Rényi, On a Problem of Information Theory, Publications of the Mathematical Institute of the Hungarian Academy of Sciences, pp.6-505, 1962.

P. [. Rall and . Slater, On Location-Domination Numbers for Certain Classes of Graphs, Congressus Numerantium, vol.45, pp.97-106, 1984.

P. [. Robertson and . Seymour, Graph Minors. XX. Wagner's conjecture, Journal of Combinatorial Theory, Series B, vol.92, issue.2, pp.325-357, 2004.
DOI : 10.1016/j.jctb.2004.08.001

D. [. Ray, A. Starobinski, R. Trachtenberg, and . Ungrangsi, Robust Location Detection With Sensor Networks, IEEE Journal on Selected Areas in Communications, vol.22, issue.6, pp.1016-1025, 2004.
DOI : 10.1109/JSAC.2004.830895

]. M. Rusz94 and . Ruszinkó, On the Upper Bound of the Size of the rcover-free Families, Journal of Combinatorial Theory Series A, vol.66, issue.2, pp.302-310, 1994.

P. [. Ruszinkó and . Vanroose, How an Erdos-Renyi-type search approach gives an explicit code construction of rate 1 for random access with multiplicity feedback, IEEE Transactions on Information Theory, vol.43, issue.1, pp.368-373, 1997.
DOI : 10.1109/18.567769

W. S. Suen, A correlation inequality and a poisson limit theorem for nonoverlapping balanced subgraphs of a random graph, Random Structures and Algorithms, vol.10, issue.2, pp.231-242, 1990.
DOI : 10.1002/rsa.3240010210

S. M. Ulam, Adventures of a Mathematician, Charles Scribner's Sons, 1976.

]. J. Van-lint and R. M. Wilson, A Course in Combinatorics, 1970.
DOI : 10.1017/CBO9780511987045

]. P. Win93 and . Winkler, Random Structures and Zero-One Laws, Proceedings of the NATO Advanced Study Institute, NATO ASI Series C 411, pp.399-420, 1993.

]. J. Zer99 and . Zerovnik, Deriving Formulas for Domination Numbers of Fasciagraphs and Rotagraphs, Lecture Notes in Computer Science, vol.1684, pp.559-568, 1999.

]. J. Zer and . Zerovnik, Deriving Formulas for the Pentomino Exclusion Problem