54 citations · 245 across the 46 of their papers we have counts for
7 papers · 1 filter
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…
ABC(T)-graphs: an axiomatic characterization of the median procedure in graphs with connected and G-connected medians
Laurine Bénéteau, Jérémie Chalopin, Victor Chepoi +1
The median function is a location/consensus function that maps any profile (a finite multiset of vertices) to the set of vertices that minimize the distance sum to vertices fro…
A simple and optimal algorithm for strict circular seriation
Mikhael Carmona, Victor Chepoi, Guyslain Naves +1
Recently, Armstrong, Guzmán, and Sing Long (2021), presented an optimal time algorithm for strict circular seriation (called also the recognition of strict quasi-circular…
First-order logic axiomatization of metric graph theory
Jérémie Chalopin, Manoj Changat, Victor Chepoi +1
The main goal of this note is to provide a First-Order Logic with Betweenness (FOLB) axiomatization of the main classes of graphs occurring in Metric Graph Theory, in analogy to Ta…
Modules in Robinson Spaces
Mikhael Carmona, Victor Chepoi, Guyslain Naves +1
A Robinson space is a dissimilarity space (i.e., a set of size and a dissimilarity on ) for which there exists a total order on such that imp…
Graphs with -connected medians
Laurine Bénéteau, Jérémie Chalopin, Victor Chepoi +1
The median of a graph with weighted vertices is the set of all vertices minimizing the sum of weighted distances from to the vertices of . For any integer ,…
Graphs with convex balls
Jérémie Chalopin, Victor Chepoi, Ugo Giocanti
In this paper, we investigate the graphs in which all balls are convex and the groups acting on them geometrically (which we call CB-graphs and CB-groups). These graphs have been i…