On Iiro Honkala's contributions to identifying codes
Copyright policy )On Iiro Honkala's contributions to identifying codes
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.
- University of Turku Finland
- TURUN YLIOPISTO Finland
- University of Paris-Saclay France
- French National Centre for Scientific Research France
FOS: Computer and information sciences, separation, Discrete Mathematics (cs.DM), graph theory, identifying codes, infinite grids, number of optimal solutions, FOS: Mathematics, Mathematics - Combinatorics, domination, binary Hamming spaces, Discrete Mathematics, twin-free graphs, Computer science, Combinatorics, combinatorics, classic parameters of graphs, Combinatorics (math.CO), complexity, Computer Science - Discrete Mathematics
FOS: Computer and information sciences, separation, Discrete Mathematics (cs.DM), graph theory, identifying codes, infinite grids, number of optimal solutions, FOS: Mathematics, Mathematics - Combinatorics, domination, binary Hamming spaces, Discrete Mathematics, twin-free graphs, Computer science, Combinatorics, combinatorics, classic parameters of graphs, Combinatorics (math.CO), complexity, Computer Science - Discrete Mathematics
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).0 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!