# Diameter, radius and all eccentricities in linear time for constant-dimension median graphs

Median graphs form the class of graphs which is the most studied in metric graph theory. Recently, Bénéteau et al. [2019] designed a linear-time algorithm computing both the Θ-classes and the median set of median graphs. A natural question emerges: is there a linear-time algorithm computing the diameter and the radius for median graphs? We answer positively to this question for median graphs G with constant dimension d, i.e. the dimension of the largest induced hypercube of G. We propose a combinatorial algorithm computing all eccentricities of median graphs with running time O(2^O(dlog d)n). As a consequence, this provides us with a linear-time algorithm determining both the diameter and the radius of median graphs with d = O(1), such as cube-free median graphs. As the hypercube of dimension 4 is not planar, it shows also that all eccentricities of planar median graphs can be computed in O(n).

• 6 publications
• 11 publications
research
10/06/2021

### Subquadratic-time algorithm for the diameter and all eccentricities on median graphs

On sparse graphs, Roditty and Williams [2013] proved that no O(n^2-ε)-ti...
research
07/24/2019

### Medians in median graphs in linear time

The median of a graph G is the set of all vertices x of G minimizing the...
research
06/02/2023

### No-dimensional Tverberg Partitions Revisited

Given a set P ⊂^d of n points, with diameter , and a parameter ∈ (0,1), ...
research
05/19/2011

### Hierarchical Recursive Running Median

To date, the histogram-based running median filter of Perreault and Hébe...
research
03/27/2018

### The balanced 2-median and 2-maxian problems on a tree

This paper deals with the facility location problems with balancing on a...
research
04/24/2023

### Median of heaps: linear-time selection by recursively constructing binary heaps

The first worst-case linear-time algorithm for selection was discovered ...
research
03/02/2022

### First-order logic axiomatization of metric graph theory

The main goal of this note is to provide a First-Order Logic with Betwee...