Abstract
Given a reliable tree network containing vertices where each edge has an independent operational probability, this paper presents finding a reliable subtree with at most leaves and with a diameter of at most which maximizes the expected number of nodes that are reachable from the selected subtree by operational paths. An efficient algorithm is presented for finding a reliable tree core of. Numerical example is explained to clarify the efficient algorithm.
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 callMore From: Menoufia Journal of Electronic Engineering Research
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.
