On Iiro Honkala’s contributions to identifying codes

Olivier Hudry (1, 2) , Ville Junnila (3) , Antoine Lobstein (4)

1 C2 - Cybersécurité et Cryptographie
2 INFRES - Département Informatique et Réseaux
3 Université de Turku
4 GALaC - LRI - Graphes, Algorithmes et Combinatoire (LRI)

A set C of vertices in a graph G = (V, E) is an identifying code if it is dominating and any two vertices of V are dominated by distinct sets of codewords. This paper presents a survey of Iiro Honkala's contributions to the study of identifying codes with respect to several aspects: complexity of computing an identifying code, combinatorics in binary Hamming spaces, infinite grids, relationships between identifying codes and usual parameters in graphs, structural properties of graphs admitting identifying codes, and number of optimal identifying codes.

Mots clés: combinatorics; identifying codes; domination; separation; twin-free graphs; complexity; binary Hamming spaces; infinite grids; classic parameters of graphs; number of optimal solutions; graph theory

Domaines: Mathématiques [math]; Informatique [cs]

Olivier Hudry, Ville Junnila, Antoine Lobstein. On Iiro Honkala’s contributions to identifying codes. Fundamenta Informaticae, inPress. ⟨hal-04568130⟩