Abstract
The subgraph configuration known as the Wheatstone bridge of s-independent elements can be replaced by a single edge in a reliabilit-preserving network transformation. The formulas for calculating the good and bad probabilities of this edge are presented. This reduction technique reduces by more than half the complexity of some backtrack algorithms that solve network reliability problems. Computational experience indicates that the benefits are worth the extra efforts it takes to perform this reduction. For problems of moderate size, use of the Wheatstone bridge reduction typically led to computational savings of between 20% and 40%.
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.
