Results 11 to 20 of about 256,860 (287)
On Iiro Honkala's contributions to identifying codes [PDF]
Fundamenta InformaticaeA set $C$ of vertices in a graph $G=(V,E)$ is an identifying code if it is dominating and any two vertices of $V$ are dominated by distinct sets of codewords. This paper presents a survey of Iiro Honkala's contributions to the study of identifying codes with respect to several aspects: complexity of computing an identifying code, combinatorics in ...
Olivier Hudry +2 more
openaire +5 more sources
Optimal Identifying Codes in Cycles and Paths [PDF]
Graphs and Combinatorics, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ville Junnila, Tero Laihonen
openaire +5 more sources
Identifying codes in some subgraphs of the square lattice [PDF]
Theoretical Computer Science, 2004 An identifying code of a graph is a subset of vertices C such that the sets B(v)∩C are all nonempty and different. In this paper, we investigate the problem of finding identifying codes of minimum cardinality in strips and finite grids.
Sylvain Gravier, Julien Moncel
exaly +2 more sources
Codes Identifying Vertices in Graphs
Electronic Notes in Discrete Mathematics, 2005 Abstract This talk deals with identifying codes in graphs. These codes we defined to model a problem of fault detection in multiprocessor systems. They are closely related to covering and superimposed codes. Very nice combinatorial questions arise from these codes, some of which we present during the talk.
Julien Moncel
exaly +2 more sources
Identifying codes for generalized quadrangles [PDF]
Journal of GeometryWe improve the known bounds on the size of identifying codes in the collinearity graphs of generalized quadrangles.We improve the known bounds on the size of identifying codes in the collinearity graphs of generalized quadrangles ...
Tamás Heger +2 more
exaly +1 more source
Adaptive Identification of Sets of Vertices in Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 Combinatorics
Ville Junnila
doaj +1 more source
Maximum difference about the size of optimal identifying codes in graphs differing by one vertex [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 Graph ...
Mikko Pelto
doaj +1 more source
On Locating-Dominating Codes in Binary Hamming Spaces [PDF]
Discrete Mathematics & Theoretical Computer Science, 2004 Locating faulty processors in a multiprocessor system gives the motivation for locating-dominating codes. We consider these codes in binary hypercubes and generalize the concept for the situation in which we want to locate more than one malfunctioning ...
Iiro Honkala, Tero Laihonen, Sanna Ranto
doaj +1 more source
JMIR Formative Research, 2022 BackgroundElectronic medical records (EMRs) offer the promise of computationally identifying sarcoidosis cases. However, the accuracy of identifying these cases in the EMR is unknown.
Mohamed I Seedahmed +7 more
doaj +1 more source
Identifying temporal codes in spontaneously active sensory neurons. [PDF]
PLoS ONE, 2011 The manner in which information is encoded in neural signals is a major issue in Neuroscience. A common distinction is between rate codes, where information in neural responses is encoded as the number of spikes within a specified time frame (encoding ...
Alexander B Neiman +2 more
doaj +1 more source