25 citations · 69 across the 12 of their papers we have counts for
16 papers
Impact of Knowledge on the Cost of Treasure Hunt in Trees
Sébastien Bouchard, Arnaud Labourel, Andrzej Pelc
A mobile agent has to find an inert target in some environment that can be a graph or a terrain in the plane. This task is known as treasure hunt. We consider deterministic algorit…
Almost-Optimal Deterministic Treasure Hunt in Arbitrary Graphs
Sébastien Bouchard, Yoann Dieudonné, Arnaud Labourel +1
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…
Distance labeling schemes for -free bridged graphs
Victor Chepoi, Arnaud Labourel, Sébastien Ratel
-Approximate distance labeling schemes are schemes that label the vertices of a graph with short labels in such a way that the -approximation of the distance between any two…
Distance and routing labeling schemes for cube-free median graphs
Victor Chepoi, Arnaud Labourel, Sebastien Ratel
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 and can be determined ef…
On density of subgraphs of halved cubes
Victor Chepoi, Arnaud Labourel, Sébastien Ratel
Let be a family of subsets of a set of cardinality and be the Vapnik-Chervonenkis dimension of . Haussler, Littlestone,…
On density of subgraphs of Cartesian products
Victor Chepoi, Arnaud Labourel, Sébastien Ratel
In this paper, we extend two classical results about the density of subgraphs of hypercubes to subgraphs of Cartesian products of arbitrary connecte…