An algorithm for enumeration of minimal path and cut sets for a communication network
Abstract
This study introduces an enhanced method for enumerating minimal paths and cuts in the global reliability evaluation of communication networks. By leveraging connection matrix representations of graphs, this technique demonstrates significant advantages in terms of computational efficiency and memory usage compared to traditional methods. The algorithm is founded on core principles of graph theory, ensuring robust and accurate assessments.
Fields of Study & Subjects
Reliability and Maintenance Optimization
Complexity and Algorithms in Graphs
Infrastructure Resilience and Vulnerability Analysis
Publication details
- Journal / source
- AIP conference proceedings
- Volume
- 3393
- Pages
- 060035–060035
- Publication date
- 1 January 2026
- Language
- EN