Pages that link to "Item:Q3649746"
From MaRDI portal
The following pages link to Computing strong metric dimension of some special classes of graphs by genetic algorithms (Q3649746):
Displaying 11 items.
- Closed formulae for the strong metric dimension of lexicographic product graphs (Q339497) (← links)
- On the strong partition dimension of graphs (Q405298) (← links)
- Minimal doubly resolving sets and the strong metric dimension of some convex polytopes (Q440965) (← links)
- The simultaneous strong metric dimension of graph families (Q726509) (← links)
- An ILP formulation and genetic algorithm for the maximum degree-bounded connected subgraph problem (Q988336) (← links)
- Computing minimal doubly resolving sets of graphs (Q1013386) (← links)
- Symmetry properties of resolving sets and metric bases in hypercubes (Q1677292) (← 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)
- Variable neighborhood search for the strong metric dimension problem (Q2840752) (← links)
