Pages that link to "Item:Q2867320"

The following pages link to Hardness results and approximation algorithms for identifying codes and locating-dominating codes in graphs (Q2867320):

Displaying 17 items.

• Identification, location-domination and metric dimension on interval and permutation graphs. I: Bounds. (Q512651) (← links)
• Network verification via routing table queries (Q743125) (← links)
• Identifying codes in vertex-transitive graphs and strongly regular graphs (Q888612) (← 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 sets: from graphs to oriented graphs (Q2092344) (← links)
• Locating-dominating codes in paths (Q2275442) (← links)
• The compared costs of domination location-domination and identification (Q2282469) (← 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)
• Locating-Domination and Identification (Q3384611) (← links)
• Solving Two Conjectures regarding Codes for Location in Circulant Graphs (Q4611776) (← links)
• Identifying Codes in Line Graphs (Q5325952) (← links)
• On Stronger Types of Locating-dominating Codes (Q5377220) (← links)
• The \textsc{Red-Blue Separation} problem on graphs (Q6168089) (← links)