Certificates in P and Subquadratic-Time Computation of Radius, Diameter, and all Eccentricities in Graphs - Inria - Institut national de recherche en sciences et technologies du numérique
Rapport (Rapport De Recherche) Année : 2024

Certificates in P and Subquadratic-Time Computation of Radius, Diameter, and all Eccentricities in Graphs

Résumé

In the context of fine-grained complexity, we investigate the notion of certificate enabling faster polynomial-time algorithms. We specifically target radius (minimum eccentricity), diameter (maximum eccentricity), and all-eccentricity computations for which quadratic-time lower bounds are known under plausible conjectures. In each case, we introduce a notion of certificate as a specific set of nodes from which appropriate bounds on all eccentricities can be derived in subquadratic time when this set has sublinear size. The existence of small certificates is a barrier against SETH-based lower bounds for these problems. We indeed prove that for graph classes with small certificates, there exist randomized subquadratic-time algorithms for computing the radius, the diameter, and all eccentricities respectively. Moreover, these notions of certificates are tightly related to algorithms probing the graph through one-to-all distance queries and allow to explain the efficiency of practical radius and diameter algorithms from the literature. Our formalization enables a novel primal-dual analysis of a classical approach for diameter computation that leads to algorithms for radius, diameter and all eccentricities with theoretical guarantees with respect to certain graph parameters. This is complemented by experimental results on various types of real-world graphs showing that these parameters appear to be low in practice. Finally, we obtain refined results for several graph classes.
Fichier principal
Vignette du fichier
main-soda.pdf (596.91 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-01729748 , version 1 (12-03-2018)
hal-01729748 , version 2 (17-10-2024)

Licence

Identifiants

Citer

Feodor F. Dragan, Guillaume Ducoffe, Michel Habib, Laurent Viennot. Certificates in P and Subquadratic-Time Computation of Radius, Diameter, and all Eccentricities in Graphs. [Research Report] Inria Paris; Université paris diderot; Kent State University; University of Bucharest, Faculty of Mathematics and Computer Science; National Institute for Research and Development in Informatics, Romania; DI ENS. 2024. ⟨hal-01729748v2⟩
218 Consultations
970 Téléchargements

Altmetric

Partager

More