Results 241 to 250 of about 251,062 (259)
Some of the next articles are maybe not open access.

Revisiting and Improving Upper Bounds for Identifying Codes

SIAM Journal on Discrete Mathematics, 2022
Tuomo Lehtilä, Florent Foucaud
exaly  

Identifying Code for Directed Graph

Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007), 2007
Yichun Xu, Renbin Xiao
openaire   +1 more source

Two families of optimal identifying codes in binary Hamming spaces

IEEE Transactions on Information Theory, 2002
I S Honkala
exaly  

On Identifying Codes in Binary Hamming Spaces

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

Identifying codes and locating–dominating sets on paths and cycles

Discrete Applied Mathematics, 2011
Zhengke Miao, Changhong Lu
exaly  

Identifying codes in some subgraphs of the square lattice

Theoretical Computer Science, 2004
Sylvain Gravier, Julien Moncel
exaly  

On the number of optimal identifying codes in a twin-free graph

Discrete Applied Mathematics, 2015
Antoine Lobstein   +2 more
exaly  

Watching systems in graphs: An extension of identifying codes

Discrete Applied Mathematics, 2013
David Auger   +2 more
exaly  

Improved Upper Bounds on Binary Identifying Codes

IEEE Transactions on Information Theory, 2007
Tero Laihonen   +2 more
exaly  

IDENTIFYING FACTORABLE CODE

2012
KIROVSKI DARKO   +5 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy