92 citations · 359 across the 37 of their papers we have counts for
4 papers · 1 filter
An improved lower bound for (1,<=2)-identifying codes in the king grid
Florent Foucaud, Tero Laihonen, Aline Parreau
We call a subset of vertices of a graph a -identifying code if for all subsets of vertices with size at most , the sets $\{c\in C |\exists u \in X,…
Tolerant identification with Euclidean balls
Ville Junnila, Tero Laihonen, Aline Parreau
The concept of identifying codes was introduced by Karpovsky, Chakrabarty and Levitin in 1998. The identifying codes can be applied, for example, to sensor networks. In this paper,…
Locally identifying colourings for graphs with given maximum degree
Florent Foucaud, Iiro Honkala, Tero Laihonen +2
A proper vertex-colouring of a graph G is said to be locally identifying if for any pair u,v of adjacent vertices with distinct closed neighbourhoods, the sets of colours in the cl…
Identifying codes in line graphs
Florent Foucaud, Sylvain Gravier, Reza Naserasr +2
An identifying code of a graph is a subset of its vertices such that every vertex of the graph is uniquely identified by the set of its neighbours within the code. We study the edg…