AbstractFault diagnosis of multiprocessor systems gives the motivation for robust identifying codes. We provide robust identifying codes for the square and king grids. Often we are able to find optimal such codes
Assume that G = (V, E) is an undirected graph, and C subset of V. For every v is an element of V, we...
AbstractLet G=(V, E) be an undirected graph and C a subset of vertices. If the sets Br(v)∩C, v∈V, ar...
AbstractFault diagnosis of multiprocessor systems gives the motivation for identifying codes. In thi...
AbstractFault diagnosis of multiprocessor systems gives the motivation for robust identifying codes....
Assume that G = (V, E) is an undirected and connected graph, and consider C subset of V. For every v...
AbstractCodes for strong identification are considered. The motivation for these codes comes from lo...
AbstractIdentifying codes are designed for locating faulty processors in multiprocessor systems. In ...
AbstractIn this paper we deal with codes identifying sets of vertices in random networks; that is, (...
We present an optimal adaptive algorithm for identifying vertices in cycles. We also give efficient ...
International audienceA set C ⊆ V (G) is an identifying code in a graph G if for all v ∈ V (G), C[v]...
The identifying code problem was introduced in 1998 by Karpovsky as a way to help fault diagnosis in...
The concept of identifying codes was introduced by Karpovsky, Chakrabarty and Levitin. These codes f...
AbstractAssume that G=(V,E) is a simple undirected graph, and C is a nonempty subset of V. For every...
AbstractIdentifying codes were defined to model fault diagnosis in multiprocessor systems. They are ...
A detection system, modeled in a graph, uses "detectors" on a subset of vertices to uniquely identif...
Assume that G = (V, E) is an undirected graph, and C subset of V. For every v is an element of V, we...
AbstractLet G=(V, E) be an undirected graph and C a subset of vertices. If the sets Br(v)∩C, v∈V, ar...
AbstractFault diagnosis of multiprocessor systems gives the motivation for identifying codes. In thi...
AbstractFault diagnosis of multiprocessor systems gives the motivation for robust identifying codes....
Assume that G = (V, E) is an undirected and connected graph, and consider C subset of V. For every v...
AbstractCodes for strong identification are considered. The motivation for these codes comes from lo...
AbstractIdentifying codes are designed for locating faulty processors in multiprocessor systems. In ...
AbstractIn this paper we deal with codes identifying sets of vertices in random networks; that is, (...
We present an optimal adaptive algorithm for identifying vertices in cycles. We also give efficient ...
International audienceA set C ⊆ V (G) is an identifying code in a graph G if for all v ∈ V (G), C[v]...
The identifying code problem was introduced in 1998 by Karpovsky as a way to help fault diagnosis in...
The concept of identifying codes was introduced by Karpovsky, Chakrabarty and Levitin. These codes f...
AbstractAssume that G=(V,E) is a simple undirected graph, and C is a nonempty subset of V. For every...
AbstractIdentifying codes were defined to model fault diagnosis in multiprocessor systems. They are ...
A detection system, modeled in a graph, uses "detectors" on a subset of vertices to uniquely identif...
Assume that G = (V, E) is an undirected graph, and C subset of V. For every v is an element of V, we...
AbstractLet G=(V, E) be an undirected graph and C a subset of vertices. If the sets Br(v)∩C, v∈V, ar...
AbstractFault diagnosis of multiprocessor systems gives the motivation for identifying codes. In thi...
DOI
Add to ORKG