Pages that link to "Item:Q4677540"
From MaRDI portal
The following pages link to Identifying and locating-dominating codes: NP-completeness results for directed graphs (Q4677540):
Displaying 26 items.
- Identifying path covers in graphs (Q396675) (← links)
- Set graphs. IV. Further connections with claw-freeness (Q400530) (← links)
- Identifying codes and locating-dominating sets on paths and cycles (Q642979) (← links)
- Domination and location in twin-free digraphs (Q777359) (← links)
- On locating--dominating sets in infinite grids (Q819007) (← links)
- Locating-dominating sets in hypergraphs (Q1677551) (← 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)
- Sufficient conditions for a digraph to admit a \((1, \leq \ell )\)-identifying code (Q2042600) (← links)
- Locating-dominating sets: from graphs to oriented graphs (Q2092344) (← links)
- Identifying codes in line digraphs (Q2189840) (← links)
- Covering codes of a graph associated with a finite vector space (Q2214154) (← links)
- Set graphs. II. Complexity of set graph recognition and similar problems (Q2253199) (← links)
- Locating-dominating sets of functigraphs (Q2333813) (← links)
- Binary locating-dominating sets in rotationally-symmetric convex polytopes (Q2337871) (← links)
- Characterizing extremal digraphs for identifying codes and extremal cases of Bondy's theorem on induced subsets (Q2376092) (← links)
- Approximability of identifying codes and locating-dominating codes (Q2379937) (← links)
- An optimal locating-dominating set in the infinite triangular grid (Q2433724) (← links)
- Locating sensors in paths and cycles: the case of 2-identifying codes (Q2462318) (← links)
- A linear algorithm for minimum 1-identifying codes in oriented trees (Q2495905) (← links)
- Locating-Domination and Identification (Q3384611) (← links)
- The binary locating-dominating number of some convex polytopes (Q4604525) (← links)
- Locating-dominating sets in local tournaments (Q6162022) (← links)
- On the binary locating-domination number of regular and strongly-regular graphs (Q6200320) (← links)
- Extremal Digraphs for open neighbourhood location-domination and identifying codes (Q6202938) (← links)
