Abstract
An analysis is presented for computing the terminal pair reliabilities of the two-centered tree (2CT), the X-tree (XT), and the ring-tree (RT). A building block is identified in the 2CT, from which a decomposition algorithm is formulated. Another building block is identified for the XT and RT from which a truss-transformation method and a computational algorithm are obtained. By comparison, it is shown that an XT is a good candidate for applications such as high bandwidth networks with high link reliability. >
Sign-in/Register to access full text options 
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.
