Beyond Helly graphs: the diameter problem on absolute retracts

01/10/2021
by   Guillaume Ducoffe, et al.
0

Characterizing the graph classes such that, on n-vertex m-edge graphs in the class, we can compute the diameter faster than in O(nm) time is an important research problem both in theory and in practice. We here make a new step in this direction, for some metrically defined graph classes. Specifically, a subgraph H of a graph G is called a retract of G if it is the image of some idempotent endomorphism of G. Two necessary conditions for H being a retract of G is to have H is an isometric and isochromatic subgraph of G. We say that H is an absolute retract of some graph class C if it is a retract of any G ∈ C of which it is an isochromatic and isometric subgraph. In this paper, we study the complexity of computing the diameter within the absolute retracts of various hereditary graph classes. First, we show how to compute the diameter within absolute retracts of bipartite graphs in randomized Õ(m√(n)) time. For the special case of chordal bipartite graphs, it can be improved to linear time, and the algorithm even computes all the eccentricities. Then, we generalize these results to the absolute retracts of k-chromatic graphs, for every fixed k ≥ 3. Finally, we study the diameter problem within the absolute retracts of planar graphs and split graphs, respectively.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/29/2020

Around the diameter of AT-free graphs

A graph algorithm is truly subquadratic if it runs in O(m^b) time on con...
research
10/23/2019

A story of diameter, radius and Helly property

A graph is Helly if every family of pairwise intersecting balls has a no...
research
02/16/2021

Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs

A graph is Helly if every family of pairwise intersecting balls has a no...
research
11/20/2016

A note about "Faster algorithms for computing Hong's bound on absolute positiveness" by K. Mehlhorn and S. Ray

We show that a linear-time algorithm for computing Hong's bound for posi...
research
10/08/2019

Fast Diameter Computation within Split Graphs

When can we compute the diameter of a graph in quasi linear time? We add...
research
12/31/2019

Constructive Characterization for Bidirected Analogue of Critical Graphs I: Principal Classes of Radials and Semiradials

This paper is the first from serial papers that provide constructive cha...
research
07/09/2019

Diameter computation on H-minor free graphs and graphs of bounded (distance) VC-dimension

We propose to study unweighted graphs of constant distance VC-dimension ...

Please sign up or login with your details

Forgot password? Click here to reset