Zobrazeno 1 - 10
of 105
pro vyhledávání: '"Labourel, Arnaud"'
A mobile agent, starting from a node $s$ of a simple undirected connected graph $G=(V,E)$, has to explore all nodes and edges of $G$ using the minimum number of edge traversals. To do so, the agent uses a deterministic algorithm that allows it to gai
Externí odkaz:
http://arxiv.org/abs/2410.13386
A mobile agent navigating along edges of a simple connected graph, either finite or countably infinite, has to find an inert target (treasure) hidden in one of the nodes. This task is known as treasure hunt. The agent has no a priori knowledge of the
Externí odkaz:
http://arxiv.org/abs/2010.14916
$k$-Approximate distance labeling schemes are schemes that label the vertices of a graph with short labels in such a way that the $k$-approximation of the distance between any two vertices $u$ and $v$ can be determined efficiently by merely inspectin
Externí odkaz:
http://arxiv.org/abs/2007.14192
Distance labeling schemes are schemes that label the vertices of a graph with short labels in such a way that the distance between any two vertices $u$ and $v$ can be determined efficiently by merely inspecting the labels of $u$ and $v$, without usin
Externí odkaz:
http://arxiv.org/abs/1809.10508
Publikováno v:
In Information and Computation November 2022 289 Part A
Let $\mathcal S$ be a family of subsets of a set $X$ of cardinality $m$ and $\text{VC-dim}(\mathcal S)$ be the Vapnik-Chervonenkis dimension of $\mathcal S$. Haussler, Littlestone, and Warmuth (Inf. Comput., 1994) proved that if $G_1(\mathcal S)=(V,E
Externí odkaz:
http://arxiv.org/abs/1711.11414
In this paper, we extend two classical results about the density of subgraphs of hypercubes to subgraphs $G$ of Cartesian products $G_1\times\cdots\times G_m$ of arbitrary connected graphs. Namely, we show that $\frac{|E(G)|}{|V(G)|}\le \lceil 2\max\
Externí odkaz:
http://arxiv.org/abs/1711.11485
A graph environment must be explored by a collection of mobile robots. Some of the robots, a priori unknown, may turn out to be unreliable. The graph is weighted and each node is assigned a deadline. The exploration is successful if each node of the
Externí odkaz:
http://arxiv.org/abs/1710.00775
Autor:
Bärtschi, Andreas, Chalopin, Jérémie, Das, Shantanu, Disser, Yann, Geissmann, Barbara, Graf, Daniel, Labourel, Arnaud, Mihalák, Matúš
Publikováno v:
Theoretical Computer Science 810:2-14, 2020
We consider the problem of collectively delivering some message from a specified source to a designated target location in a graph, using multiple mobile agents. Each agent has a limited energy which constrains the distance it can move. Hence multipl
Externí odkaz:
http://arxiv.org/abs/1608.08500
Autor:
Anaya, Julian, Chalopin, Jérémie, Czyzowicz, Jurek, Labourel, Arnaud, Pelc, Andrzej, Vaxès, Yann
A set of identical, mobile agents is deployed in a weighted network. Each agent has a battery -- a power source allowing it to move along network edges. An agent uses its battery proportionally to the distance traveled. We consider two tasks : conver
Externí odkaz:
http://arxiv.org/abs/1603.04234