Add to ORKGWe present an optimal adaptive algorithm for identifying vertices in cycles. We also give efficient adaptive algorithms for identifying sets of vertices in different graphs such as cycles, king lattices and square lattices. Adaptive identification is also considered in Hamming spaces, which is one of the most widely studied graphs in the field of identifying codes
AbstractFor a graph G and a set D⊆V(G), define Nr[x]={xi∈V(G):d(x,xi)≤r} (where d(x,y) is graph theo...
AbstractThe concept of identifying codes was introduced by Karpovsky, Chakrabarty and Levitin. These...
AbstractAn identifying code of a graph is a subset of vertices C such that the sets B(v)∩C are all n...
The concept of identifying codes in a graph was introduced by Karpovsky et al. (in IEEE Trans Inf Th...
AbstractAn adaptive version of identifying codes is introduced. These codes are motivated by various...
The work presented in this document deals with identifying codes in graphs. This notion, introduced ...
In this thesis, we study problems on vertices identification of graphs. To identify the vertices of ...
Dans cette thèse, nous étudions des problèmes d'identification des sommets dans les graphes. Identif...
AbstractIdentifying codes were defined to model fault diagnosis in multiprocessor systems. They are ...
The concept of identifying codes was introduced by Karpovsky, Chakrabarty and Levitin. These codes f...
Master of ScienceDepartment of MathematicsSarah ReznikoffA (1, ≤ 2)-identifying code is a subset of...
AbstractLet G=(V,E) be a graph and let r≥1 be an integer. For a set D⊆V, define Nr[x]={y∈V:d(x,y)≤r}...
Many practical problems in networks such as fault detection and diagnosis, location detection, envir...
Diplomsko delo obravnava adaptivne identifikacijske kode v grafih, ki so povezane z identi- fikacijs...
AbstractConsider a connected undirected graph G=(V,E), a subset of vertices C⊆V, and an integer r≥1;...
AbstractFor a graph G and a set D⊆V(G), define Nr[x]={xi∈V(G):d(x,xi)≤r} (where d(x,y) is graph theo...
AbstractThe concept of identifying codes was introduced by Karpovsky, Chakrabarty and Levitin. These...
AbstractAn identifying code of a graph is a subset of vertices C such that the sets B(v)∩C are all n...
The concept of identifying codes in a graph was introduced by Karpovsky et al. (in IEEE Trans Inf Th...
AbstractAn adaptive version of identifying codes is introduced. These codes are motivated by various...
The work presented in this document deals with identifying codes in graphs. This notion, introduced ...
In this thesis, we study problems on vertices identification of graphs. To identify the vertices of ...
Dans cette thèse, nous étudions des problèmes d'identification des sommets dans les graphes. Identif...
AbstractIdentifying codes were defined to model fault diagnosis in multiprocessor systems. They are ...
The concept of identifying codes was introduced by Karpovsky, Chakrabarty and Levitin. These codes f...
Master of ScienceDepartment of MathematicsSarah ReznikoffA (1, ≤ 2)-identifying code is a subset of...
AbstractLet G=(V,E) be a graph and let r≥1 be an integer. For a set D⊆V, define Nr[x]={y∈V:d(x,y)≤r}...
Many practical problems in networks such as fault detection and diagnosis, location detection, envir...
Diplomsko delo obravnava adaptivne identifikacijske kode v grafih, ki so povezane z identi- fikacijs...
AbstractConsider a connected undirected graph G=(V,E), a subset of vertices C⊆V, and an integer r≥1;...
AbstractFor a graph G and a set D⊆V(G), define Nr[x]={xi∈V(G):d(x,xi)≤r} (where d(x,y) is graph theo...
AbstractThe concept of identifying codes was introduced by Karpovsky, Chakrabarty and Levitin. These...
AbstractAn identifying code of a graph is a subset of vertices C such that the sets B(v)∩C are all n...