Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard
Theoretical Computer Science
Identifying and locating-dominating codes on chains and cycles
European Journal of Combinatorics
On a new class of codes for identifying vertices in graphs
IEEE Transactions on Information Theory
Improved bounds on identifying codes in binary Hamming spaces
European Journal of Combinatorics
Minimal identifying codes in trees and planar graphs with large girth
European Journal of Combinatorics
On the size of identifying codes in triangle-free graphs
Discrete Applied Mathematics
Set graphs. I. Hereditarily finite sets and extensional acyclic orientations
Discrete Applied Mathematics
Hi-index | 0.04 |
Consider an oriented graph G=(V,A), a subset of vertices C@?V, and an integer r=1; for any vertex v@?V, let B"r^-(v) denote the set of all vertices x such that there exists a path from x to v with at most r arcs. If for all vertices v@?V, the sets B"r^-(v)@?C are all nonempty and different, then we call C an r-identifying code. We describe a linear algorithm which gives a minimum 1-identifying code in any oriented tree.