摘要
The validation and evaluation of network reliability are significant issues in the planning, design, and control of systems. The minimal path (MP, an edge set) set is one of the main tools used in measuring network reliability. A new node-based concept to find all MPs is proposed by simply searching all of the ordered node subsets with a time complexity $O$ ( $ne^{n}$ ), where $n$ is the number of nodes. The proposed concept is implemented in a newly proposed node-based MP algorithm using depth-first search (DFS). Because $O(m)=O(n^{2})$ , where $m$ is the number of edges, the proposed node-based MP algorithm is theoretically more efficient than conventional edge-based algorithms, which all use time complexity O( $n 2^{m}$ ) to search for all MPs. Finally, a series of numerical experiments is implemented to test the performance of the proposed algorithm. © 2013 IEEE.