.png){kind=icon}
返回
Shortest Path Tree Computation in Dynamic Graphs
.png){kind=icon}
PRE
AI
DOI：10.1109/TC.2008.198.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Let G=(V, E, w) be a simple digraph, in which all edge weights are nonnegative real numbers. Let G' be obtained from G by an application of a set of edge weight updates to G. Let s is an element of V and let T-s and T'(s) be Shortest Path Trees (SPTs) rooted at s in G and G', respectively. The Dynamic Shortest Path ( DSP) problem is to compute T'(s) from Ts. Existing work on this problem focuses on either a single edge weight change or multiple edge weight changes in which some of them are incorrect or are not optimized. We correct and extend a few state-of-the-art dynamic SPT algorithms to handle multiple edge weight updates. We prove that these algorithms are correct. Dynamic algorithms may not outperform static algorithms all the time. To evaluate the proposed dynamic algorithms, we compare them with the well-known static Dijkstra algorithm. Extensive experiments are conducted with both real-life and artificial data sets. The experimental results suggest the most appropriate algorithms to be used under different circumstances.
Keyword:
Dynamic shortest path
shortest path trees
dynamic graphs
dynamic algorithms
graph algorithms
routing protocol
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.8
论文数:
5.4K
被引数:
9.8K
机构
引用论文
.png){kind=icon}
分享收藏分享收藏Inverse design of photonic crystal filters with arbitrary correlation and size for accurate spectrum reconstruction具有任意相关性和尺寸的光子晶体滤波器的逆设计，以实现精确的光谱重建
PREAI
分享收藏
查看更多内容