On Iiro Honkala's contributions to identifying codes

Olivier Hudry, Ville Junnila, Antoine Lobstein

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…