The power of interval models for computing graph centralities - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Romanian Journal of Information Technology and Automatic Control Année : 2022

The power of interval models for computing graph centralities

Puterea modelelor de interval în problema calculării indicilor de centralitate

Résumé

Food webs, some scheduling problems and DNA molecules all have in common a "linear structure" which can be captured through the idealized model of interval graphs (intersection graphs of intervals on a line). However, real data is prone to errors and noise, thus raising the question of whether the algorithmic results obtained for the interval graphs could be extended to more realistic models of "almost interval" graphs. We address this question in the context of computing the vertex eccentricities, one of the most studied centrality indices in order to determine the relative importance of nodes in a network. We give a positive answer for the interval+kv graphs and a negative one (assuming plausible complexity hypotheses) for the graphs of bounded interval number. In particular, we present an almost linear-time algorithm for computing all vertex eccentricities in an interval+kv graph, for any fixed k, thus improving on the recent quadratic-time algorithm of (Bentert & Nichterlein, 2022) for this problem.
Fichier principal
Vignette du fichier
Interval_models (2).pdf (333.64 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03906922 , version 1 (19-12-2022)

Identifiants

Citer

Guillaume Ducoffe. The power of interval models for computing graph centralities. Romanian Journal of Information Technology and Automatic Control, 2022, 32 (4), pp.33-44. ⟨10.33436/v32i4y202203⟩. ⟨hal-03906922⟩
12 Consultations
36 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More