logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

A new algorithm in enumerating all minimal paths in a sparse network

delete1999-06-01
delete61
PRE
AI
K
Kazuya Kobayashi *
H
Hisashi Yamamoto
DOI：10.1016/S0951-8320(98)00076-3delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

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.
Keywords:
minimal paths
depth-first-search
reliability
sparse network
enumeration
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

R
Reliability Engineering and System Safety
IF:
11
Papers:
9.0K
Citations:
4.2W

Organization

No organization information available