Revisiting Radius, Diameter, and all Eccentricity Computation in Graphs through Certificates - Archive ouverte HAL Access content directly
Reports (Research Report) Year : 2018

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

(1) , (2, 3) , (2, 3)
1
2
3

Abstract

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.
Fichier principal
Vignette du fichier
diam.pdf (464.83 Ko) Télécharger le fichier

Dates and versions

hal-01729748 , version 1 (12-03-2018)

Identifiers

Cite

Feodor F. Dragan, Michel Habib, Laurent Viennot. Revisiting Radius, Diameter, and all Eccentricity Computation in Graphs through Certificates. [Research Report] Inria Paris; Université paris diderot; Kent State University. 2018. ⟨hal-01729748⟩
198 View
834 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More