Abstract
This paper proposes a computational method for the reliability of 2-separable networks. Based on graph theory and probability theory, this method simplifies the calculation process by constructing a network equivalent model and designing corresponding algorithms to achieve the efficient evaluation of reliability. Considering independent random failures of edges with equal probability q, this method can accurately calculate the reliability of 2-separable networks, and its effectiveness and accuracy are verified through examples. In addition, to demonstrate the generality of our method, we have also applied it to other 2-separable networks with fractal structures and proposed linear algorithms for calculating their all-terminal reliability.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
