Zobrazeno 1 - 10
of 60
pro vyhledávání: '"Di Fonso, Alessia"'
Visibility problems have been investigated for a long time under different assumptions as they pose challenging combinatorial problems and are connected to robot navigation problems. The mutual-visibility problem in a graph $G$ of $n$ vertices asks t
Externí odkaz:
http://arxiv.org/abs/2407.00409
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 agent) and efficiency (i.e., messages are delivered through shortest pa
Externí odkaz:
http://arxiv.org/abs/2405.13615
Autor:
Cicerone, Serafino, Di Fonso, Alessia, Di Stefano, Gabriele, Navarra, Alfredo, Piselli, Francesco
Let $G$ be a graph and $X\subseteq V(G)$. Then, vertices $x$ and $y$ of $G$ are $X$-visible if there exists a shortest $u,v$-path where no internal vertices belong to $X$. The set $X$ is a mutual-visibility set of $G$ if every two vertices of $X$ are
Externí odkaz:
http://arxiv.org/abs/2308.14443
The \textsc{Mutual Visibility} is a well-known problem in the context of mobile robots. For a set of $n$ robots disposed in the Euclidean plane, it asks for moving the robots without collisions so as to achieve a placement ensuring that no three robo
Externí odkaz:
http://arxiv.org/abs/2308.01855
The severity of wildfires can be mitigated adopting preventive measures like the construction of firebreaks that are strips of land from which the vegetation is completely removed. In this paper, we model the problem of wildfire containment as an opt
Externí odkaz:
http://arxiv.org/abs/2204.05475
Publikováno v:
In Theoretical Computer Science 21 May 2024 996
In the last decade, wildfires have become wider and more destructive. The climate change and the growth of urban areas may further increase the probability of incidence of large-scale fires. The risk of fire can be lowered with preventive measures. A
Externí odkaz:
http://arxiv.org/abs/2103.10115
Given a set R of robots, each one located at different vertices of an infinite regular tessellation graph, we aim to explore the Arbitrary Pattern Formation (APF) problem. Given a multiset F of grid vertices such that |R|=|F|, APF asks for a distribu
Externí odkaz:
http://arxiv.org/abs/2010.14152
Publikováno v:
In Pervasive and Mobile Computing October 2023 95
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.