-
Combinatorial and algorithmic aspects of identifying codes in graphs
We study combinatorial and algorithmic aspects of identifying codes in graphs. An identifying code is a set of vertices of a graph such that, on the one hand, each... -
Tolerant identification with Euclidean balls
International audience -
Decision and approximation complexity for identifying codes and locating-domi...
International audience
