Skip to Content
TechnologiesTechnologies
  • Article
  • Open Access

7 March 2025

12 Pages

Enhancing Computational Efficiency of Network Reliability with a New Prime Shortest Path Algorithm

,
and
1
Department of Industrial Engineering and Engineering Management, National Tsing Hua University, P.O. Box 24-60, Hsinchu 300044, Taiwan
2
School of Computer Science, Guangdong Polytechnic Normal University, Guangzhou 510665, China
3
Department of International Logistics and Transportation Management, Kainan University, Taoyuan 33857, Taiwan
*
Author to whom correspondence should be addressed.

Abstract

To address the increasing demands of modern networks, evaluating computational efficiency of modified network reliability is essential, with minimal paths (MPs) serving as a critical factor. However, traditional approaches to assessing computational efficiency of network reliability often struggle with challenges such as duplicate MPs and sub-path identification, resulting in exponential computational time. In this study, we present a novel algorithm based on the Prime Shortest Path (PSP) approach, which efficiently resolves these challenges by self-detecting and eliminating duplication in polynomial time. This marks a significant improvement over existing methods. The algorithm’s correctness is rigorously validated, and its superior performance is confirmed through a detailed time complexity analysis and comparisons with the leading state-of-the-art algorithms.

Article Metrics

Citations

Article Access Statistics

Multiple requests from the same IP address are counted as one view.