A1 Refereed original research article in a scientific journal
On Iiro Honkala's Contributions to Identifying Codes
Authors: Hudry, Olivier; Junnila, Ville; Lobstein, Antoine
Publisher: IOS Press BV
Publication year: 2024
Journal: Fundamenta Informaticae
Journal name in source: Fundamenta Informaticae
Volume: 191
Issue: 3-4
First page : 165
Last page: 196
ISSN: 0169-2968
eISSN: 1875-8681
DOI: https://doi.org/10.3233/FI-242178
Web address : https://doi.org/10.3233/FI-242178
Self-archived copy’s web address: https://research.utu.fi/converis/portal/detail/Publication/457458578
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.
Downloadable publication This is an electronic reprint of the original article. |  |
Funding information in the publication:
The author Ville Junnila was funded in part by the Academy of Finland grant 338797.
