Gabriele Di Stefano

activity

20172026

most citedA methodology to design distributed algorithms for mobile entities: the pattern formation problem as case study

4 citations · 6 across the 20 of their papers we have counts for

collaborators

Showing 2021Show all

2 papers · 1 filter

math.CO2021

On the mutual visibility in Cartesian products and triangle-free graphs

Serafino Cicerone, Gabriele Di Stefano, Sandi Klavzar

Given a graph $G = (V (G), E (G))$ and a set $P \subseteq V (G)$ , the following concepts have been recently introduced: $(i)$ two elements of $P$ are \emph{mutually visible} if there is…

math.CO2021

Mutual Visibility in Graphs

Gabriele Di Stefano

Let $G = (V, E)$ be a graph and $P \subseteq V$ a set of points. Two points are mutually visible if there is a shortest path between them without further points. $P$ is a mutual-visibi…