Minimum Spanning Trees in Weakly Dynamic Graphs - Normandie Université Access content directly
Conference Papers Year : 2017

Minimum Spanning Trees in Weakly Dynamic Graphs


In this paper, we study weakly dynamic undirected graphs, that can be used to represent some logistic networks. The goal is to deliver all the delivery points in the network. The network exists in a mostly stable environment, except for a few edges known to be non-stable. The weight of each of these non-stable edges may change at any time (bascule or lift bridge, elevator, traffic congestion...). All other edges have stable weights that never change. This problem can be now considered as a Minimum Spanning Tree (MST) problem on a dynamic graph. We propose an efficient polynomial algorithm that computes in advance alternative MSTs for all possible configurations. No additional computation is then needed after any change in the problem because the MSTs are already known in all cases. We use these results to compute critical values for the non-stable weights and to pre-compute best paths. When the non-stable weights change, the appropriate MST may then directly and immediately be used without any recomputation.
Fichier principal
Vignette du fichier
logistica17.pdf (460.5 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02094631 , version 1 (09-04-2019)



Moustafa Nakechbandi, Jean-Yves Colin, Hervé Mathieu. Minimum Spanning Trees in Weakly Dynamic Graphs. LOGISTIQUA 2017, 10th International Colloquium of Logistics and Supply Chain Management, Apr 2017, Rabat, Morocco. ⟨hal-02094631⟩
40 View
105 Download



Gmail Facebook X LinkedIn More