Let G be a graph and X⊆ V(G). Then, vertices x and y of G
are X-visible ...
The Mutual Visibility is a well-known problem in the context of
mobile r...
The concept of mutual-visibility in graphs has been recently introduced....
If X is a subset of vertices of a graph G, then vertices u and v are
X-v...
Given a set R of robots, each one located at different vertices of an
in...
Following the wide investigation in distributed computing issues by mobi...