Variable neighborhood search (VNS) is a metaheuristic for solving combinatorial and global
optimization problems whose basic idea is a systematic change of neighborhood both within …

Consider a robot that is navigating a graph-based environment and trying to figure out
where it is at the moment. It can send a signal to determine how far away it is from every set …

The metric dimension of a graph is the smallest number of nodes required to identify all
other nodes uniquely based on shortest path distances. Applications of metric dimension …

Topics concerning metric dimension related invariants in graphs are nowadays intensively
studied. This compendium of combinatorial and computational results on this topic is an …

We consider, in this paper, the NP‐hard problem of finding the minimum connected
domination metric dimension of graphs. A vertex set B of a connected graph G=(V, E) …

In this paper, we consider the NP-hard problem of finding the minimum connected resolving
set of graphs. A vertex set B of a connected graph G resolves G if every vertex of G is …

In this paper, we consider the NP-hard problem of finding the minimum resolving set of
graphs. A vertex set B of a connected graph G resolves G if every vertex of G is uniquely …

In this article, we look at the NP-hard problem of determining the minimum independent
domination metric dimension of graphs. A vertex set B of a connected graph G (V, E) …

Numerous data analysis and data mining techniques require that data be embedded in a
Euclidean space. When faced with symbolic datasets, particularly biological sequence data …

A dominating set S of a graph is a metric-locating-dominating set if each vertex of the graph
is uniquely distinguished by its distances from the elements of S, and the minimum …