Pages that link to "Item:Q1401220"
From MaRDI portal
The following pages link to Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard. (Q1401220):
Displayed 44 items.
- More results on the complexity of identifying problems in graphs (Q264560) (← links)
- On the ensemble of optimal identifying codes in a twin-free graph (Q267807) (← links)
- A comparison of approaches for finding minimum identifying codes on graphs (Q296102) (← links)
- A polyhedral approach to locating-dominating sets in graphs (Q324734) (← links)
- The minimum identifying code graphs (Q423972) (← links)
- On the number of optimal identifying codes in a twin-free graph (Q476309) (← links)
- Identification, location-domination and metric dimension on interval and permutation graphs. I: Bounds. (Q512651) (← links)
- Identifying codes in some subgraphs of the square lattice (Q596073) (← links)
- Identifying codes and locating-dominating sets on paths and cycles (Q642979) (← links)
- Combinatorial identification problems and graph powers (Q766254) (← links)
- On locating--dominating sets in infinite grids (Q819007) (← links)
- Extremal cardinalities for identifying and locating-dominating codes in graphs (Q864121) (← links)
- Identifying codes in vertex-transitive graphs and strongly regular graphs (Q888612) (← links)
- Identifying codes of cycles with odd orders (Q942141) (← links)
- Minimal identifying codes in trees and planar graphs with large girth (Q976158) (← links)
- Locating-dominating sets in hypergraphs (Q1677551) (← links)
- On identification in the triangular grid (Q1826954) (← links)
- Identifying and locating-dominating codes on chains and cycles (Q1883609) (← links)
- Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes (Q2018540) (← links)
- Set graphs. II. Complexity of set graph recognition and similar problems (Q2253199) (← links)
- Locating-dominating codes in paths (Q2275442) (← links)
- On two variations of identifying codes (Q2275454) (← links)
- Locating-paired-dominating sets in square grids (Q2346332) (← links)
- Computing the metric dimension for chain graphs (Q2346556) (← links)
- A note on the locating-total domination in graphs (Q2364093) (← links)
- Approximability of identifying codes and locating-dominating codes (Q2379937) (← links)
- Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity (Q2408094) (← links)
- Extremal graphs for the identifying code problem (Q2430979) (← links)
- An optimal locating-dominating set in the infinite triangular grid (Q2433724) (← links)
- Identifying codes of corona product graphs (Q2449061) (← links)
- Locating sensors in paths and cycles: the case of 2-identifying codes (Q2462318) (← links)
- Identifying codes of cycles (Q2488842) (← links)
- A linear algorithm for minimum 1-identifying codes in oriented trees (Q2495905) (← links)
- On graphs on \(n\) vertices having an identifying code of cardinality \(\lceil \log_{2}(n+1)\rceil\) (Q2506367) (← links)
- Domination Parameters in Hypertrees (Q2795956) (← links)
- Algorithms and Complexity for Metric Dimension and Location-domination on Interval and Permutation Graphs (Q2827829) (← links)
- Separating Codes and Traffic Monitoring (Q2830061) (← links)
- Identifying Codes in Trees and Planar Graphs (Q2851521) (← links)
- (Q2857369) (← links)
- Identifying codes and watching systems in Kneser graphs (Q2966507) (← links)
- Complexity results for identifying codes in planar graphs (Q3002553) (← links)
- Identifying Codes in Hereditary Classes of Graphs and VC-Dimension (Q3449863) (← links)
- Identifying and Locating–Dominating Codes in (Random) Geometric Networks (Q3557518) (← links)
- Identifying Codes in Line Graphs (Q5325952) (← links)