A Population-Based Local Search Algorithm for the Identifying Code Problem
Mathematics, 2023 The identifying code problem for a given graph involves finding a minimum subset of vertices such that each vertex of the graph is uniquely specified by its nonempty neighborhood within the identifying code.
Alejandro Lara-Caballero +1 more
doaj +3 more sources
The minimum identifying code graphs
Discrete Applied Mathematics, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
André Raspaud, Li-Da Tong
exaly +2 more sources
The identifying code number and Mycielski's construction of graphs [PDF]
Transactions on Combinatorics, 2022 Let $G=(V, E)$ be a simple graph. A set $C$ of vertices $G$ is an identifying code of $G$ if for every two vertices $x$ and $y$ the sets $N_{G} [x] \cap C$ and $N_{G} [y] \cap C$ are non-empty and different.
Athena Shaminejad +2 more
doaj +1 more source
Value of the International Classification of Diseases code for identifying children with biliary atresia [PDF]
Clinical and Experimental Pediatrics, 2021 Background Although identifying cases in large administrative databases may aid future research studies, previous reports demonstrated that the use of the International Classification of Diseases, Tenth Revision (ICD-10) code alone for diagnosis leads to
Pornthep Tanpowpong +3 more
doaj +1 more source
Sufficient Conditions for a Digraph to Admit A (1, ≤ ℓ)-Identifying Code
Discussiones Mathematicae Graph Theory, 2021 A (1, ≤ ℓ)-identifying code in a digraph D is a subset C of vertices of D such that all distinct subsets of vertices of cardinality at most ℓ have distinct closed in-neighbourhoods within C. In this paper, we give some sufficient conditions for a digraph
Balbuena Camino +2 more
doaj +1 more source
Exact values for three domination-like problems in circular and infinite grid graphs of small height [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 In this paper we study three domination-like problems, namely identifying codes, locating-dominating codes, and locating-total-dominating codes. We are interested in finding the minimum cardinality of such codes in circular and infinite grid graphs of ...
Marwane Bouznif +3 more
doaj +1 more source
QR CODES WITH ANIMATION FOR DIGITAL PASSES [PDF]
Научно-технический вестник информационных технологий, механики и оптики, 2020 people monitoring and identifying in service, identification badges and passes. Method. The methods are based on image processing and barcoding procedures applying QR codes. Main Results.
Georgy Kukharev, Nazym Kaziyeva
doaj +1 more source
Identifying the challenges of code/theory translation: report from the Code/Theory 2017 workshop [PDF]
Research Ideas and Outcomes, 2017 The Code/Theory workshop explored the process of translating between theory and code, from the perspective of those who do this work on a day to day basis.
Caroline Jay +15 more
doaj +2 more sources
Constructions of r-identifying codes and (r, ≤ l)-identifying codes
Indian Journal of Pure and Applied Mathematics, 2019 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dhanalakshmi, R., Durairajan, C.
+6 more sources
The Compared Costs of Domination Location-Domination and Identification
Discussiones Mathematicae Graph Theory, 2020 Let G = (V, E) be a finite graph and r ≥ 1 be an integer. For v ∈ V, let Br(v) = {x ∈ V : d(v, x) ≤ r} be the ball of radius r centered at v. A set C ⊆ V is an r-dominating code if for all v ∈ V, we have Br(v) ∩ C ≠ ∅; it is an r-locating-dominating code
Hudry Olivier, Lobstein Antoine
doaj +1 more source