3 citations · 4 across the 4 of their papers we have counts for
6 papers
Non-Clashing Teaching Maps for Balls in Graphs
Jérémie Chalopin, Victor Chepoi, Fionn Mc Inerney +1
Recently, Kirkpatrick et al. [ALT 2019] and Fallat et al. [JMLR 2023] introduced non-clashing teaching and showed it is the most efficient machine teaching model satisfying the Gol…
Sample compression schemes for balls in graphs
Jérémie Chalopin, Victor Chepoi, Fionn Mc Inerney +2
One of the open problems in machine learning is whether any set-family of VC-dimension admits a sample compression scheme of size . In this paper, we study this problem f…
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…