Result 1 to 20 from 39 total
Combinatorial identification problems and graph powers. (English)
4OR 9, No. 4, 417-420 (2011).
1
Identifying codes and locating-dominating sets on paths and cycles. (English)
Discrete Appl. Math. 159, No. 15, 1540-1547 (2011).
2
Improved bounds for $r$-identifying codes of the hex grid. (English)
SIAM J. Discrete Math. 25, No. 1, 159-169 (2011).
3
On two variations of identifying codes. (English)
Discrete Math. 311, No. 17, 1948-1956 (2011).
4
On binary linear $r$-identifying codes. (English)
Des. Codes Cryptography 60, No. 1, 81-89 (2011).
5
Complexity results for identifying codes in planar graphs. (English)
Int. Trans. Oper. Res. 17, No. 6, 691-710 (2010).
6
Identifying codes in $q$-ary hypercubes. (English)
Bull. Inst. Comb. Appl. 59, 93-102 (2010).
7
New identifying codes in the binary Hamming space. (English)
Eur. J. Comb. 31, No. 2, 491-501 (2010).
8
Improved bounds on identifying codes in binary Hamming spaces. (English)
Eur. J. Comb. 31, No. 3, 813-827 (2010).
9
Joint monitoring and routing in wireless sensor networks using robust identifying codes. (English)
Mob. Netw. Appl. 14, No. 4, 415-432 (2009).
10
Upper bounds for binary identifying codes. (English)
Adv. Appl. Math. 42, No. 3, 277-289 (2009).
11
Discriminating codes in bipartite graphs: Bounds, extremal cardinalities, complexity. (English)
Adv. Math. Commun. 2, No. 4, 403-420 (2008).
12
Adaptive identification in graphs. (English)
J. Comb. Theory, Ser. A 115, No. 7, 1114-1126 (2008).
13
On cages admitting identifying codes. (English)
Eur. J. Comb. 29, No. 3, 737-741 (2008).
14
Approximability of identifying codes and locating-dominating codes. (English)
Inf. Process. Lett. 103, No. 1, 28-33 (2007).
15
Links between discriminating and identifying codes in the binary Hamming space. (English)
Boztaş, Serdar (ed.) et al., Applied algebra, algebraic algorithms and error-correcting codes. 17th international symposium, AAECC-17, Bangalore, India, December 16‒20, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-77223-1/pbk). Lecture Notes in Computer Science 4851, 267-270 (2007).
16
Codes identifying sets of vertices in random networks. (English)
Discrete Math. 307, No. 9-10, 1094-1107 (2007).
17
On graphs having a $V\setminus \{x\}$ set as an identifying code. (English)
Discrete Math. 307, No. 3-5, 432-434 (2007).
18
Optimal $t$-edge-robust $r$-identifying codes in the king lattice. (English)
Graphs Comb. 22, No. 4, 487-496 (2006).
19
Constructing codes identifying sets of vertices. (English)
Des. Codes Cryptography 41, No. 1, 23-31 (2006).
20
Result 1 to 20 from 39 total
Start
Contact
Print
General Help
