Publication:2717197
From MaRDI portal
zbMath0990.94036MaRDI QIDQ2717197
Gilles Zémor, Antoine C. Lobstein, Iiro S. Honkala, Gérard D. Cohen
Publication date: 18 September 2001
68R10: Graph theory (including graph drawing) in computer science
94B65: Bounds on codes
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
94B60: Other types of codes
Related Items
On the Distance Identifying Set Meta-Problem and Applications to the Complexity of Identifying Problems on Graphs, Progress on fault-tolerant locating-dominating sets, More results on the complexity of identifying problems in graphs, Identifying codes in some subgraphs of the square lattice, Identifying codes and locating-dominating sets on paths and cycles, Combinatorial identification problems and graph powers, On the \textsc{Distance Identifying Set} meta-problem and applications to the complexity of identifying problems on graphs, On robust identification in the square and King grids, Discriminating codes in (bipartite) planar graphs, On identifying codes in the hexagonal mesh, Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard., Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori, The minimum density of an identifying code in the king lattice., Optimal codes for strong identification, Localization game on geometric and planar graphs, Unique (optimal) solutions: complexity results for identifying and locating-dominating codes, On identification in the triangular grid, On the density of identifying codes in the square lattice, New results of identifying codes in product graphs, Set graphs. II. Complexity of set graph recognition and similar problems, Approximability of identifying codes and locating-dominating codes, Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity, Extremal graphs for the identifying code problem, Identifying codes of corona product graphs, Locating sensors in paths and cycles: the case of 2-identifying codes, A linear algorithm for minimum 1-identifying codes in oriented trees, Locating-Domination and Identification, Discriminating codes in bipartite graphs
