Revisiting Radius, Diameter, and all Eccentricity Computation in Graphs through Certificates

03/13/2018
by   Feodor Dragan, et al.
0

We introduce notions of certificates allowing to bound eccentricities in a graph. In particular , we revisit radius (minimum eccentricity) and diameter (maximum eccentricity) computation and explain the efficiency of practical radius and diameter algorithms by the existence of small certificates for radius and diameter plus few additional properties. We show how such computation is related to covering a graph with certain balls or complementary of balls. We introduce several new algorithmic techniques related to eccentricity computation and propose algorithms for radius, diameter and all eccentricities with theoretical guarantees with respect to certain graph parameters. This is complemented by experimental results on various real-world graphs showing that these parameters appear to be low in practice. We also obtain refined results in the case where the input graph has low doubling dimension, has low hyperbolicity, or is chordal.

READ FULL TEXT

page 1

page 2

page 3

page 4

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
07/24/2018

On critical and maximal digraphs

This paper is devoted to the study of directed graphs with extremal prop...
research
05/09/2022

On Turedo Hierarchies and Intrinsic Universality

This paper is about turedos, which are Turing machine whose head can mov...
research
01/09/2020

What is the Value of Data? On Mathematical Methods for Data Quality Estimation

Data is one of the most important assets of the information age, and its...
research
12/15/2017

Rectilinear Link Diameter and Radius in a Rectilinear Polygonal Domain

We study the computation of the diameter and radius under the rectilinea...
research
07/16/2022

Solving Graph Laplacians via Multilevel Sparsifiers

We consider effective preconditioners for solving Laplacians of general ...
research
09/14/2021

Online Algorithms with Lookaround

We introduce a new model of computation: the online LOCAL model (OLOCAL)...

Please sign up or login with your details

Forgot password? Click here to reset