arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1904.05066cs.DSmath.OC
收藏

弱动态图的最小生成树

Minimum Spanning Trees in Weakly Dynamic Graphs

Moustafa Nakechbandi, Jean-Yves Colin, Hervé Mathieu

摘要:

本文研究了弱动态无向图,它可以用来表示某些逻辑网络。目标是交付网络中的所有交付点。该网络存在于一个大部分稳定的环境中,除了少数已知不稳定的边缘。这些不稳定边缘中的每一个的重量都可能在任何时候改变(开闭或升降桥、电梯、交通拥堵.)。所有其他边都具有永不改变的稳定权重。这个问题现在可以被认为是动态图上的最小生成树(MST)问题。我们提出了一个有效的多项式算法,计算提前替代MST的所有可能的配置。在问题发生任何变化之后,不需要额外的计算,因为在所有情况下MST都是已知的。我们使用这些结果来计算临界值的不稳定的权重,并预先计算最佳路径。当非稳定权重改变时,然后可以直接且立即使用适当的MST而无需任何重新计算。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑