An improved algorithm for finding all minimal paths in a network
详细信息 查看全文
- 作者：Guanghan Bai ; Zhigang Tian ; ztian@ualberta.ca" class="auth_mail" title="E-mail the corresponding author ; Ming J. Zuo
- 关键词：Minimal path ; Backtracking ; Network reliability ; Linked path structure ; Recursive algorithm
- 刊名：Reliability Engineering & System Safety
- 出版年：2016
- 出版时间：June 2016
- 年：2016
- 卷：150
- 期：Complete
- 页码：1-10
- 全文大小：653 K
文摘
- •
A linked path structure indexed by nodes is introduced to represent networks.
- •
Additional conditions for backtracking are proposed based on the distance of each node.
- •
An efficient algorithm is developed to find all MPs for two-terminal networks.
- •
The computational efficiency of the algorithm for two-terminal networks is investigated.
- •
The computational efficiency of the algorithm for multi-terminal networks is investigated.