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