Computing strong metric dimension of some special classes of graphs by genetic algorithms

DOI10.2298/YJOR0802143KzbMath1199.68546MaRDI QIDQ3649746

Jozef Kratica, Mirjana Čangalović, Vera V. Kovacevic-Vujcic

Publication date: 4 December 2009

Published in: Yugoslav Journal of Operations Research (Search for Journal in Brave)

zbMATH Keywords

stochastic algorithmsheuristic searchgraph invariantevolutionary computing

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Randomized algorithms (68W20)

Related Items (11)

Closed formulae for the strong metric dimension of lexicographic product graphs ⋮ Symmetry properties of resolving sets and metric bases in hypercubes ⋮ Variable neighborhood search for metric dimension and minimal doubly resolving set problems ⋮ On the strong partition dimension of graphs ⋮ Strong resolving graphs: the realization and the characterization problems ⋮ Minimal doubly resolving sets and the strong metric dimension of some convex polytopes ⋮ On the geodesic identification of vertices in convex plane graphs ⋮ An ILP formulation and genetic algorithm for the maximum degree-bounded connected subgraph problem ⋮ The simultaneous strong metric dimension of graph families ⋮ Computing minimal doubly resolving sets of graphs ⋮ Variable neighborhood search for the strong metric dimension problem

This page was built for publication: Computing strong metric dimension of some special classes of graphs by genetic algorithms