.png){kind=icon}
Return
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}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
graph theory
network
quickest path
simple path
paths ranking
Journal
C
IF:
4.3
Papers:
6.5K
Citations:
1.8W
Organization
No organization information available
Cited Papers
Correlation of an Adenine-Specific Conformational Change with the ATP-Dependent Peptidase Activity ofEscherichia coliLon.png)
Biochemistry
BiochemistryIF0
PREAI
ShareSaveShareSave
ShareSaveSSR: Joint Optimization of Recommendation and Adaptive Bitrate Streaming for Short-form Video Feed
PREAI
ShareSaveShareSave no more
no more