3 papers
cs.CC2024
On the approximability of graph visibility problems
Davide Bilò, Alessia Di Fonso, Gabriele Di Stefano +1
Visibility problems have been investigated for a long time under different assumptions as they pose challenging combinatorial problems and are connected to robot navigation problem…
cs.DC2024
An optimal algorithm for geodesic mutual visibility on hexagonal grids
Sahar Badri, Serafino Cicerone, Alessia Di Fonso +1
For a set of robots (or agents) moving in a graph, two properties are highly desirable: confidentiality (i.e., a message between two agents must not pass through any intermediate a…
math.CO2024
Mutual-visibility in strong products of graphs via total mutual-visibility
Serafino Cicerone, Gabriele Di Stefano, Sandi Klavžar +1
Let be a graph and . Then is a mutual-visibility set if each pair of vertices from is connected by a geodesic with no internal vertex in . The mutua…