Y. Vaxès

collaborators

4 papers

math.CO2025

Isometric path complexity of graphs

Dibyayan Chakraborty, JÃ©rÃ©mie Chalopin, Florent Foucaud +1

A set $S$ of isometric paths of a graph $G$ is `` $v$ -rooted'', where $v$ is a vertex of $G$ , if $v$ is one of the endpoints of all the isometric paths in $S$ . The isometric path co…

cs.DS2025

On $G^{p}$ -unimodality of radius functions in graphs: structure and algorithms

JÃ©rÃ©mie Chalopin, Victor Chepoi, Feodor Dragan +2

For every weight assignment $I ¨ $ to the vertices in a graph $G$ , the radius function $r_{I ¨} $ maps every vertex of $G$ to its largest weighted distance to the other vertices. The cen…

math.CO2024

ABC(T)-graphs: an axiomatic characterization of the median procedure in graphs with connected and G $^{2}$ -connected medians

The median function is a location/consensus function that maps any profile $I ¨ $ (a finite multiset of vertices) to the set of vertices that minimize the distance sum to vertices fr…

cs.DS2024

Additive approximation algorithm for geodesic centers in $I^´$ -hyperbolic graphs

Dibyayan Chakraborty, Yann VaxÃ¨s

For an integer $k \geq 1$ , the objective of \textsc{ $k$ -Geodesic Center} is to find a set $C$ of $k$ isometric paths such that the maximum distance between any vertex $v$ …

Isometric path complexity of graphs

On Gp-unimodality of radius functions in graphs: structure and algorithms

ABC(T)-graphs: an axiomatic characterization of the median procedure in graphs with connected and G2-connected medians

Additive approximation algorithm for geodesic centers in I^´-hyperbolic graphs

On $G^{p}$ -unimodality of radius functions in graphs: structure and algorithms

ABC(T)-graphs: an axiomatic characterization of the median procedure in graphs with connected and G $^{2}$ -connected medians

Additive approximation algorithm for geodesic centers in $I^´$ -hyperbolic graphs