Results 281 to 290 of about 3,507,644 (308)

1-identifying codes on trees

Australas. J Comb., 2005
Summary: Consider a connected undirected graph \(G=(V,E)\), a subset of vertices \(C \subseteq V\), and an integer \(r\geq 1\); for any vertex \(v\in V\), let \(B_r(v)\) denote the ball of radius \(r\) centered at \(v\), i.e., the set of all vertices within distance \(r\) from \(v\).
Nathalie Bertrand 0001, Irène Charon, Olivier Hudry, Antoine Lobstein   +3 more
openaire   +2 more sources

Codes Identifying Sets of Vertices

2001
We consider identifying and strongly identifying codes. Finding faulty processors in a multiprocessor system gives the motivation for these codes. Constructions and lower bounds on these codes are given.We provide two infinite families of optimal (1, ? 2)-identifying codes, which can find malfunctioning processors in a binary hypercube F2n.
Tero Laihonen, Sanna M. Ranto
openaire   +1 more source

Identifying Code-switching in Arabizi

Proceedings of the Seventh Arabic Natural Language Processing Workshop (WANLP), 2022
Safaa Shehadi, Shuly Wintner
openaire   +1 more source

On identifying codes

2001
Gérard D. Cohen, Iiro S. Honkala, Antoine Lobstein, Gilles Zémor   +3 more
openaire   +2 more sources

Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard

Theoretical Computer Science, 2003
Antoine Lobstein, Irène Charon, Olivier Hudry   +2 more
exaly  

On Identifying Codes in Binary Hamming Spaces

Journal of Combinatorial Theory - Series A, 2002
Iiro Honkala
exaly  

Identifying Codes in Line Graphs

Journal of Graph Theory, 2013
Reza Naserasr, Florent Foucaud, Petru Valicov   +2 more
exaly  

Bounds for Codes Identifying Vertices in the Hexagonal Grid

SIAM Journal on Discrete Mathematics, 2000
Antoine Lobstein, Gilles Zémor, Iiro Honkala   +2 more
exaly  

On Codes Identifying Sets of Vertices in Hamming Spaces

Designs, Codes, and Cryptography, 2001
Tero Laihonen, Sanna Ranto, Iiro Honkala
exaly  

On Identifying Codes in the Triangular and Square Grids

SIAM Journal on Computing, 2004
Tero Laihonen, Iiro Honkala
exaly