Pré-Publication, Document De Travail Année : 2025

On the Complexity of Computing a Fastest Temporal Path in Interval Temporal Graphs

Résumé

Temporal graphs arise when modeling interactions that evolve over time. They usually come in several flavors, depending on the number of parameters used to describe the temporal aspects of the interactions: time of appearance, duration, delay of transmission. In the point model, edges appear at specific points in time, while in the more general interval model, edges can be present over multiple time intervals. In both models, the delay for traversing an edge can change with each edge appearance. When time is discrete, the two models are equivalent in the sense that the presence of an edge during an interval is equivalent to a sequence of point-in-time occurrences of the edge. However, this transformation can drastically change the size of the input and has complexity issues. Indeed, we show a gap between the two models with respect to the complexity of the classical problem of computing a fastest temporal path from a source vertex to a target vertex, i.e. a path where edges can be traversed one after another in time and such that the total duration from source to target is minimized. It can be solved in near-linear time in the point model, while we show that the interval model requires quadratic time under classical assumptions of fine-grained complexity. With respect to linear time, our lower bound implies a factor of the number of vertices, while the best known algorithm has a factor of the number of underlying edges. Interestingly, we show that near-linear time is possible in the interval model when restricted to all delays being zero, i.e. traversing an edge is instantaneous.
Fichier principal
Vignette du fichier
main-hal.pdf (251.22 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04863343 , version 1 (17-01-2025)

Licence

Identifiants

  • HAL Id : hal-04863343 , version 1

Citer

Guillaume Aubian, Filippo Brunelli, Feodor F Dragan, Guillaume Ducoffe, Michel Habib, et al.. On the Complexity of Computing a Fastest Temporal Path in Interval Temporal Graphs. 2025. ⟨hal-04863343⟩
1 Consultations
13 Téléchargements

Partager

More