-
On two variations of identifying codes
International audience -
An improved lower bound for (1,<=2)-identifying codes in the king grid
International audience -
New results on variants of covering codes in Sierpinski graphs
International audience -
Minimum Sizes of Identifying Codes in Graphs Differing by One Edge or One Vertex
Let $G$ be a simple, undirected graph with vertex set $V$. For $v \in V$ and $r \geq 1$, we denote by $B_{G,r}(v)$ the ball of radius $r$ and centre $v$. A set $C... -
Bounds for identifying codes in terms of degree parameters
International audience -
Identifying codes in line graphs
International audience -
Constant time generic algorithms for resolution of combinatorial optimization...
A fasciagraph of length n and of fiber F, is constituted of n consecutive copies of a graph F, each copy being linked to the next one according to a same scheme.... -
Identification problems in graphs
In this thesis, we study problems on vertices identification of graphs. To identify the vertices of a graph consists in giving to each vertex of the graph an object... -
Characterizing extremal digraphs for identifying codes and extremal cases of ...
International audience -
On packing, colouring and identification problems
In this thesis we study three theoretical computer science problems, namely the orthogonal packing problem (OPP for short), strong edge-colouring and identifying... -
Identification de sommets dans les graphes
The work presented in this document deals with identifying codes in graphs. This notion, introduced in the late 1990's, models fault-detection problems in networks. An... -
On Locating-Dominating Codes in Binary Hamming Spaces
International audience -
Adaptive Identification of Sets of Vertices in Graphs
Combinatorics
