.png){kind=icon}
返回
An algorithm for ranking quickest simple paths
.png){kind=icon}
OA
AI
DOI：10.1016/S0305-0548(03)00250-8.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, an algorithm for ranking loopless paths in undirected networks, according to the transmission time, is presented. It is shown that the worst-case computational time complexity of the algorithm presented is phi(Kr(m + n log n)), which is also the best-known complexity to solve this problem. The worst-case memory complexity is phi(Kn), which improves the existing algorithms. Finally, comparative computational results, with other algorithms for the same problem, are reported. (C) 2003 Elsevier Ltd. All rights reserved.
Keyword:
graph theory
network
quickest path
simple path
paths ranking
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
暂无机构信息
引用论文
Correlation of an Adenine-Specific Conformational Change with the ATP-Dependent Peptidase Activity ofEscherichia coliLon.png)
Biochemistry
BiochemistryIF0
PREAI
分享收藏分享收藏
SSR: Joint Optimization of Recommendation and Adaptive Bitrate Streaming for Short-form Video Feed
PREAI
分享收藏 没有更多内容
没有更多内容