Results 1 to 10 of about 256,761 (188)
Constructions of r-identifying codes and (r, ≤ l)-identifying codes [PDF]
Indian Journal of Pure and Applied Mathematics, 2019 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
C Durairajan
exaly +9 more sources
On two variations of identifying codes [PDF]
Discrete Mathematics, 2011 Identifying codes have been introduced in 1998 to model fault-detection in multiprocessor systems. In this paper, we introduce two variations of identifying codes: weak codes and light codes. They correspond to fault-detection by successive rounds. We give exact bounds for those two definitions for the family of cycles.
Sylvain Gravier +2 more
exaly +5 more sources
Locating and Identifying Codes in Circulant Graphs [PDF]
Discrete Dynamics in Nature and Society, 2021 Identifying and locating-dominating codes have been studied widely in circulant graphs. Recently, Ville Junnila et al. (Optimal bounds on codes for location in circulant graphs, Cryptography and Communications; 2019) studied identifying and locating ...
Shu Jiao Song, Weiqian Zhang, Can Xu
doaj +2 more sources
On strongly identifying codes [PDF]
Discrete Mathematics, 2002 Given an undirected graph \(G=(V,E)\), the set of all vertices within distance \(t\) from a vertex \(v \in V\) is denoted by \(B_t(v)\). A set \(C \subseteq V\) is called a \(t\)-identifying code if all sets \(B_t(v)\cap C\) are nonempty and different.
Iiro S. Honkala +2 more
openaire +2 more sources
Identifying codes in line digraphs [PDF]
Applied Mathematics and Computation, 2020 Given an integer $\ell\ge 1$, a $(1,\le \ell)$-identifying code in a digraph is a dominating subset $C$ of vertices such that all distinct subsets of vertices of cardinality at most $\ell$ have distinct closed in-neighbourhood within $C$. In this paper, we prove that every $k$-iterated line digraph of minimum in-degree at least 2 and $k\geq2$, or ...
Balbuena Martínez, Maria Camino Teófila +2 more
openaire +7 more sources
Robotic process automation for identifying missing codes on insurance claims [PDF]
BMJ Health & Care InformaticsObjectives This study aimed to develop and implement robotic process automation (RPA) for identifying missing codes during insurance claim post-review at a tertiary hospital and to evaluate its feasibility and effectivenessMethods As a single-centre ...
Jiyun Lee +6 more
doaj +2 more sources
On cages admitting identifying codes [PDF]
European Journal of Combinatorics, 2008 The motivation for identifying codes, introduced in [IEEE Trans. Inf. Theory 44, No. 2, 599--611 (1998; Zbl 1105.94342)] by \textit{M. G. Karpovsky}, \textit{K. Chakrabarty} and \textit{L. B. Levitin}, comes from finding faulty processors in a multiprocessor system.
Laihonen, Tero
openaire +3 more sources
Identifying codes of cycles [PDF]
European Journal of Combinatorics, 2006 We deal with identifying codes in cycles and show that for all \(r\geq 1\), any \(r\)-identifying code of the cycle \({\mathcal C}_n\) has cardinality at least \(\text{gcd}(2r+1,n)\left\lceil\frac{n}{2\text{gcd}(2r+1,n)}\right\rceil\).. This lower bound is enough to solve the case \(n\) even (which was already solved in [\textit{N. Bertrand, I. Charon,
Gravier, Sylvain +2 more
openaire +3 more sources
Identifying codes and locating–dominating sets on paths and cycles [PDF]
Discrete Applied Mathematics, 2011 Let 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} and Dr(x)=Nr[x]∩D, where d(x,y) denotes the number of edges in any shortest path between x and y. D is known as an r-identifying code (r-locating-dominating set,
Changhong Lu, Zhengke Miao
exaly +2 more sources
Polyhedra associated with identifying codes [PDF]
Electronic Notes in Discrete Mathematics, 2013 Abstract The identifying code problem is a newly emerging search problem, challenging both from a theoretical and a computational point of view, even for special graphs like bipartite graphs. Hence, a typical line of attack for this problem is to determine minimum identifying codes of special graphs or to provide bounds for their size.
Gabriela R. Argiroffo +2 more
openaire +3 more sources