Abstract

In this paper some new ideas are presented concerning speeding up calculation of coefficients of all-terminal reliability polynomial (CRPs) of an undirected random graph with reliable nodes and unreliable links. Along with the task of obtaining exact values of CRPs , the task of their fast estimation is discussed. We try estimate CRPs in one of possible representations of reliability polynomial (RP) based on their meaning and counting all a fortiori connected and disconnected states of a graph using easily obtained information. We show how several steps of known exact methods anticipatory to calculation of CRPs bounds increase their quality.

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 call

Disclaimer: 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.