.png){kind=icon}
返回
A new algorithm in enumerating all minimal paths in a sparse network
.png){kind=icon}
PRE
AI
DOI：10.1016/S0951-8320(98)00076-3.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper an efficient algorithm is proposed that generates all minimal paths in a sparse network. When we analyze a complex network reliability, it is important to enumerate all minimal paths. The DFS algorithm is the well-known method for enumerating all minimal paths. Shen has provided a DFS algorithm that is simple and easy to program. Our proposed algorithm is composed of Shen's algorithm and some additional processes. Computational results show that our algorithm is more efficient than Shen's for many sparse networks. (C) 1999 Elsevier Science Ltd. All rights reserved.
Keyword:
minimal paths
depth-first-search
reliability
sparse network
enumeration
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
R
IF:
11
论文数:
9.0K
被引数:
4.2W
机构
暂无机构信息
.png){kind=icon}
