scientific article; zbMATH DE number 4053685
From MaRDI portal
Publication:3789614
Recommendations
Cited in
(66)- Upper bounds for binary identifying codes
- On minimum dominating sets with minimum intersection
- Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard.
- Well-located graphs: A collection of well-covered ones
- Locating-dominating sets in hypergraphs
- On the (adjacency) metric dimension of corona and strong product graphs and their local variants: combinatorial and computational results
- Unique (optimal) solutions: complexity results for identifying and locating-dominating codes
- Identifying and locating-dominating codes on chains and cycles
- Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes
- Polyhedra associated with locating-dominating, open locating-dominating and locating total-dominating sets in graphs
- Covering codes of a graph associated with a finite vector space
- On two variations of identifying codes
- Bounds on the locating-total domination number in trees
- The compared costs of domination location-domination and identification
- Locating-dominating sets of functigraphs
- Locating-paired-dominating sets in square grids
- Approximability of identifying codes and locating-dominating codes
- Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity
- Locating and identifying codes in circulant networks
- Locating sensors in paths and cycles: the case of 2-identifying codes
- A linear algorithm for minimum 1-identifying codes in oriented trees
- Locating and total dominating sets in trees
- On redundant locating-dominating sets
- Algorithms and complexity for metric dimension and location-domination on interval and permutation graphs
- The difference between the metric dimension and the determining number of a graph
- Locating-total dominating sets in twin-free graphs: a conjecture
- A polyhedral approach to locating-dominating sets in graphs
- Location-domination in line graphs
- Locating-domination and identification
- Discriminating codes in bipartite graphs
- The determining number of a Cartesian product
- On the size of identifying codes in triangle-free graphs
- On the Distance Identifying Set Meta-Problem and Applications to the Complexity of Identifying Problems on Graphs
- Bounds on the locating-total domination number of a tree
- The metric dimension of the lexicographic product of graphs
- Some results about a conjecture on identifying codes in complete suns
- Some rainbow problems in graphs have complexity equivalent to satisfiability problems
- \( [ 1 , 2 ]\)-dimension of graphs
- Progress on fault-tolerant locating-dominating sets
- Open neighborhood locating-dominating in trees
- Identifying codes and locating-dominating sets on paths and cycles
- Fault-tolerant locating-dominating sets on the infinite tumbling block graph
- A note on locating-dominating sets in twin-free graphs
- Optimal error-detection system for identifying codes
- Fault-tolerant locating-dominating sets with error-correction
- On full-separating sets and related codes in graphs
- Structural parameterization of locating-dominating set and test cover
- On open-separating dominating codes in graphs
- On full-separating sets in graphs
- Fault-tolerant identifying codes in special classes of graphs
- Error-correcting open-locating-dominating sets
- Open-separating dominating codes in graphs
- Tight (double) exponential bounds for identification problems: locating-dominating set and test cover
- Independent location-domination number of graphs
- Tight (double) exponential bounds for identification problems: locating-dominating set and test cover
- New results on vertices that belong to every minimum locating-dominating code
- On the \textsc{Distance Identifying Set} meta-problem and applications to the complexity of identifying problems on graphs
- Bibliography on domination in graphs and some basic definitions of domination parameters
- On locating--dominating sets in infinite grids
- Extremal cardinalities for identifying and locating-dominating codes in graphs
- Locating-dominating sets in twin-free graphs
- Bounds on the differentiating-total domination number of a tree
- Location-domination and matching in cubic graphs
- Locating and paired-dominating sets in graphs
- Determining sets, resolving sets, and the exchange property
- Minimal identifying codes in trees and planar graphs with large girth
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3789614)
