Pages that link to "Item:Q849088"
From MaRDI portal
The following pages link to Computing the metric dimension of graphs by genetic algorithms (Q849088):
Displaying 13 items.
- Minimal doubly resolving sets and the strong metric dimension of some convex polytopes (Q440965) (← 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)
- On the metric dimension of infinite graphs (Q1759836) (← links)
- Variable neighborhood search for metric dimension and minimal doubly resolving set problems (Q1926742) (← links)
- A bridge between the minimal doubly resolving set problem in (folded) hypercubes and the coin weighing problem (Q2065777) (← links)
- Learning to compute the metric dimension of graphs (Q2161840) (← links)
- An IP-based swapping algorithm for the metric dimension and minimal doubly resolving set problems in hypercubes (Q2174878) (← links)
- Low-dimensional representation of genomic sequences (Q2311893) (← links)
- Resolving the hypercube (Q2446831) (← links)
- Minimal doubly resolving sets of prism graphs (Q2868916) (← links)
- Getting the Lay of the Land in Discrete Space: A Survey of Metric Dimension and Its Applications (Q6071823) (← links)
