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):
Displaying 33 items.
- Identifying codes on directed de Bruijn graphs (Q2416416) (← 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)
- On redundant locating-dominating sets (Q2686136) (← 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)
- Edge identifying codes (Q2857369) (← links)
- Hardness results and approximation algorithms for identifying codes and locating-dominating codes in graphs (Q2867320) (← links)
- Identifying codes and watching systems in Kneser graphs (Q2966507) (← links)
- Complexity results for identifying codes in planar graphs (Q3002553) (← links)
- Locating-Domination and Identification (Q3384611) (← links)
- Identifying Codes in Hereditary Classes of Graphs and VC-Dimension (Q3449863) (← links)
- Identifying and Locating–Dominating Codes in (Random) Geometric Networks (Q3557518) (← links)
- The binary locating-dominating number of some convex polytopes (Q4604525) (← links)
- On the Distance Identifying Set Meta-Problem and Applications to the Complexity of Identifying Problems on Graphs (Q5009472) (← links)
- (Q5135780) (← links)
- Identifying Codes in Line Graphs (Q5325952) (← links)
- Some rainbow problems in graphs have complexity equivalent to satisfiability problems (Q6071083) (← links)
- Complexity and approximation for discriminating and identifying code problems in geometric setups (Q6107885) (← links)
- On the binary locating-domination number of regular and strongly-regular graphs (Q6200320) (← links)
- On Iiro Honkala's contributions to identifying codes (Q6614534) (← links)
- On three domination-based identification problems in block graphs (Q6614535) (← links)
- Fault-tolerant locating-dominating sets on the infinite tumbling block graph (Q6644885) (← links)
- An extension of locating-total domination problem and its complexity (Q6652677) (← links)
- Optimal error-detection system for identifying codes (Q6663966) (← links)
- The adjacency dimension of some path related trees (Q6669557) (← links)