Pages that link to "Item:Q2840752"
From MaRDI portal
The following pages link to Variable neighborhood search for the strong metric dimension problem (Q2840752):
Displaying 8 items.
- Closed formulae for the strong metric dimension of lexicographic product graphs (Q339497) (← links)
- The simultaneous strong metric dimension of graph families (Q726509) (← links)
- A metaheuristic approach to the dominating tree problem (Q1677304) (← links)
- Strong resolving graphs: the realization and the characterization problems (Q1693153) (← links)
- Variable neighborhood search for metric dimension and minimal doubly resolving set problems (Q1926742) (← links)
- On the geodesic identification of vertices in convex plane graphs (Q2217853) (← links)
- Arbitrary-norm hyperplane separation by variable neighbourhood search (Q5432694) (← links)
- Variable Neighborhood Search Approach for Solving Roman and Weak Roman Domination Problems on Graphs (Q5878012) (← links)