scientific article; zbMATH DE number 2147927
From MaRDI portal
Publication:4659582
zbMath1081.94039MaRDI QIDQ4659582
Irène Charon, Nathalie Bertrand, Olivier Hudry, Antoine C. Lobstein
Publication date: 21 March 2005
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (20)
Identifying and locating-dominating codes on chains and cycles ⋮ Identifying codes in the complementary prism of cycles ⋮ Revisiting and Improving Upper Bounds for Identifying Codes ⋮ Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity ⋮ Improved upper bounds for identifying codes in \(n\)-dimensional \(q\)-ary cubes ⋮ On three domination-based identification problems in block graphs ⋮ Extremal graphs for the identifying code problem ⋮ On the size of identifying codes in triangle-free graphs ⋮ Identifying codes and locating-dominating sets on paths and cycles ⋮ Identifying codes of the direct product of two cliques ⋮ Locating and identifying codes in circulant networks ⋮ Identifying codes in the direct product of a complete graph and some special graphs ⋮ Identifying codes of cycles with odd orders ⋮ Identification, location-domination and metric dimension on interval and permutation graphs. I: Bounds. ⋮ Identifying codes of cycles ⋮ Minimal identifying codes in trees and planar graphs with large girth ⋮ A linear algorithm for minimum 1-identifying codes in oriented trees ⋮ On two variations of identifying codes ⋮ Liar's domination ⋮ Locating-Domination and Identification
This page was built for publication:
