Pages that link to "Item:Q512531"
From MaRDI portal
The following pages link to On optimal approximability results for computing the strong metric dimension (Q512531):
Displaying 5 items.
- Approximation complexity of metric dimension problem (Q450564) (← links)
- Strong resolving graphs: the realization and the characterization problems (Q1693153) (← links)
- On the geodesic identification of vertices in convex plane graphs (Q2217853) (← links)
- On graphs of order \(n\) with metric dimension \(n-4\) (Q2689112) (← links)
- A note on the complexity of \(k\)\textsc{-metric dimension} (Q6096304) (← links)
