Pages that link to "Item:Q2379937"
From MaRDI portal
The following pages link to Approximability of identifying codes and locating-dominating codes (Q2379937):
Displaying 14 items.
- Network verification via routing table queries (Q743125) (← links)
- On the (adjacency) metric dimension of corona and strong product graphs and their local variants: combinatorial and computational results (Q1693144) (← links)
- Unique (optimal) solutions: complexity results for identifying and locating-dominating codes (Q1733054) (← 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)
- Locating-dominating codes in paths (Q2275442) (← links)
- Metric-locating-dominating sets of graphs for constructing related subsets of vertices (Q2333263) (← 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)
- Complexity results for identifying codes in planar graphs (Q3002553) (← links)
- Identifying Codes in Hereditary Classes of Graphs and VC-Dimension (Q3449863) (← links)
- Identifying Codes in Line Graphs (Q5325952) (← links)
- On Stronger Types of Locating-dominating Codes (Q5377220) (← links)
- Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding (Q5757455) (← links)
