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 50 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 the \textsc{Distance Identifying Set} meta-problem and applications to the complexity of identifying problems on graphs (Q786037) (← 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)
- Localization game on geometric and planar graphs (Q1627842) (← links)
- Locating-dominating sets in hypergraphs (Q1677551) (← links)
- On the (adjacency) metric dimension of corona and strong product graphs and their local variants: combinatorial and computational results (Q1693144) (← links)
- Separating codes and traffic monitoring (Q1704860) (← links)
- Unique (optimal) solutions: complexity results for identifying and locating-dominating codes (Q1733054) (← links)
- Progress on the description of identifying code polyhedra for some families of split graphs (Q1751187) (← links)
- Polyhedra associated with identifying codes in graphs (Q1752479) (← links)
- Operads of finite posets (Q1753009) (← links)
- On the minimum size of an identifying code over all orientations of a graph (Q1753015) (← 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)
- On locating-dominating set of regular graphs (Q2052122) (← links)
- Polyhedra associated with locating-dominating, open locating-dominating and locating total-dominating sets in graphs (Q2081516) (← links)
- The identifying code, the locating-dominating, the open locating-dominating and the locating total-dominating problems under some graph operations (Q2132340) (← links)
- Identifying codes in the complementary prism of cycles (Q2132351) (← links)
- On the watching number of graphs using discharging procedure (Q2143854) (← links)
- The watching system as a generalization of identifying code (Q2180726) (← links)
- Domination parameters in hypertrees and sibling trees (Q2181261) (← links)
- Linear-time algorithms for three domination-based separation problems in block graphs (Q2184661) (← links)
- Covering codes of a graph associated with a finite vector space (Q2214154) (← links)
- New results of identifying codes in product graphs (Q2245049) (← 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)
- Alternative parameterizations of \textsc{Metric Dimension} (Q2285127) (← links)
- Locating-dominating sets of functigraphs (Q2333813) (← links)
- Binary locating-dominating sets in rotationally-symmetric convex polytopes (Q2337871) (← 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)
- A linear-time algorithm for the identifying code problem on block graphs (Q2413180) (← links)
