.png){kind=icon}
返回
On the K shortest path trees problem
.png){kind=icon}
OA
AI
DOI：10.1016/j.ejor.2009.06.017.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We address the problem of finding the K best path trees connecting a source node with any other non-source node in a directed network with arbitrary lengths. The main result in this paper is the proof that the kth shortest path tree is adjacent to at least one of the previous (k - 1) shortest path trees. Consequently, we design an O(f(n, m, C-max) + Km) time and C(K + m) space algorithm to determine the K shortest path trees, in a directed network with n nodes, m arcs and maximum absolute length C-max, where O(f (n, m, C-max)) is the best time needed to solve the shortest simple paths connecting a source node with any other non-source node. (C) 2009 Elsevier B.V. All rights reserved.
Keyword:
Network/graphs
K shortest path trees problem
Shortest path tree problem
K best spanning tree
K best solutions
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
Validating Dynamic Testing of Fabric Crease Recovery with the Standard AATCC Test Method.png)
AATCC Review
AATCC ReviewIF0
PREAI
分享收藏International guidelines for self-report and proxy completion of paediatric health-related quality of life measures: a protocol for a systematic reviewBMJ Open
OAAI
BMJ OpenIF0
OAAI分享收藏分享收藏
查看更多内容