Pages that link to "Item:Q2018540"
From MaRDI portal
The following pages link to Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes (Q2018540):
Displayed 15 items.
- More results on the complexity of identifying problems in graphs (Q264560) (← links)
- Identification, location-domination and metric dimension on interval and permutation graphs. I: Bounds. (Q512651) (← links)
- Parameterized and approximation complexity of \textsc{Partial VC Dimension} (Q1731844) (← links)
- Unique (optimal) solutions: complexity results for identifying and locating-dominating codes (Q1733054) (← links)
- Operads of finite posets (Q1753009) (← links)
- On the minimum size of an identifying code over all orientations of a graph (Q1753015) (← links)
- Bounding the trace function of a hypergraph with applications (Q2089531) (← links)
- Metric-locating-dominating sets of graphs for constructing related subsets of vertices (Q2333263) (← links)
- Locating-dominating sets of functigraphs (Q2333813) (← links)
- Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity (Q2408094) (← links)
- Algorithms and Complexity for Metric Dimension and Location-domination on Interval and Permutation Graphs (Q2827829) (← links)
- Locating-Domination and Identification (Q3384611) (← links)
- Identifying Codes in Hereditary Classes of Graphs and VC-Dimension (Q3449863) (← links)
- Complexity and approximation for discriminating and identifying code problems in geometric setups (Q6107885) (← links)
- On three domination-based identification problems in block graphs (Q6132542) (← links)