54 citations · 245 across the 46 of their papers we have counts for
5 papers · 1 filter
Unlabeled sample compression schemes and corner peelings for ample and maximum classes
Jérémie Chalopin, Victor Chepoi, Shay Moran +1
We examine connections between combinatorial notions that arise in machine learning and topological notions in cubical/simplicial geometry. These connections enable to export resul…
1-Safe Petri nets and special cube complexes: equivalence and applications
Jérémie Chalopin, Victor Chepoi
Nielsen, Plotkin, and Winskel (1981) proved that every 1-safe Petri net unfolds into an event structure . By a result of Thiagarajan (1996 and 2002), these unfol…
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…
Fast approximation of centrality and distances in hyperbolic graphs
Victor Chepoi, Feodor F. Dragan, Michel Habib +2
We show that the eccentricities (and thus the centrality indices) of all vertices of a -hyperbolic graph can be computed in linear time with an additive one-sided erro…
Fast approximation and exact computation of negative curvature parameters of graphs
Jérémie Chalopin, Victor Chepoi, Feodor F. Dragan +3
In this paper, we study Gromov hyperbolicity and related parameters, that represent how close (locally) a metric space is to a tree from a metric point of view. The study of Gromov…