Olivier Hudry ; Ville Junnila ; Antoine Lobstein - On Iiro Honkala's contributions to identifying codes

fi:13052 - Fundamenta Informaticae, November 10, 2024, Volume 191, Issues 3-4: Iiro Honkala's 60 Birthday
On Iiro Honkala's contributions to identifying codesArticle

Authors: 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 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.


    Volume: Volume 191, Issues 3-4: Iiro Honkala's 60 Birthday
    Published on: November 10, 2024
    Accepted on: June 28, 2024
    Submitted on: February 14, 2024
    Keywords: Computer Science - Discrete Mathematics,Mathematics - Combinatorics

    Consultation statistics

    This page has been seen 5 times.
    This article's PDF has been downloaded 4 times.