An Algorithm for Single-Source Shortest Paths Enumeration in Parameterized Weighted Graphs - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2021

An Algorithm for Single-Source Shortest Paths Enumeration in Parameterized Weighted Graphs

Résumé

We consider weighted graphs with parameterized weights and we propose an algorithm that, given such a graph and a source node, builds a collection of trees, each one describing the shortest paths from the source to all the other nodes of the graph for a particular zone of the parameter space. Moreover, the union of these zones covers the full parameter space: given any valuation of the parameters, one of the trees gives the shortest paths from the source to all the other nodes of the graph when the weights are computed using this valuation.
Fichier principal
Vignette du fichier
seree-LATA-21.pdf (326.81 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03561972 , version 1 (08-02-2022)

Identifiants

Citer

Bastien Sérée, Loïg Jezequel, Didier Lime. An Algorithm for Single-Source Shortest Paths Enumeration in Parameterized Weighted Graphs. Language and Automata Theory and Applications, Sep 2021, Milan, Italy. pp.279-290, ⟨10.1007/978-3-030-68195-1_22⟩. ⟨hal-03561972⟩
16 Consultations
96 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More