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

by   Pierre Bergé, et al.

On sparse graphs, Roditty and Williams [2013] proved that no O(n^2-ε)-time algorithm achieves an approximation factor smaller than 3/2 for the diameter problem unless SETH fails. In this article, we solve a longstanding question: can we use the structural properties of median graphs to break this global quadratic barrier? We propose the first combinatiorial algorithm computing exactly all eccentricities of a median graph in truly subquadratic time. Median graphs constitute the family of graphs which is the most studied in metric graph theory because their structure represent many other discrete and geometric concepts, such as CAT(0) cube complexes. Our result generalizes a recent one, stating that there is a linear-time algorithm for all eccentricities in median graphs with bounded dimension d, i.e. the dimension of the largest induced hypercube. This prerequisite on d is not necessarily anymore to determine all eccentricities in subquadratic time. The execution time of our algorithm is O(n^1.6456log^O(1) n). We provide also some satellite outcomes related to this general result. In particular, restricted to simplex graphs, this algorithm enumerate all eccentricities with a quasilinear running time. Moreover, an algorithm is proposed to compute exactly all reach centralities in time O(2^3dnlog^O(1)n).


page 1

page 2

page 3

page 4


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 metr...

Medians in median graphs in linear time

The median of a graph G is the set of all vertices x of G minimizing the...

Hierarchical Recursive Running Median

To date, the histogram-based running median filter of Perreault and Hébe...

Towards Tight Approximation Bounds for Graph Diameter and Eccentricities

Among the most important graph parameters is the Diameter, the largest d...

Isometric embeddings in trees and their use in the diameter problem

We prove that given a discrete space with n points which is either embed...

A Fast Exact Algorithm for Airplane Refueling Problem

We consider the airplane refueling problem, where we have a fleet of air...

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

This paper deals with the facility location problems with balancing on a...

Please sign up or login with your details

Forgot password? Click here to reset