Abstract
AbstractWhich is the most reliable graph with n nodes and m edges? This celebrated problem has several aspects, according to the notion of optimality (in a local or uniform sense), failure type (either nodes or edges), or reliability model (all‐terminal connectedness, two‐terminal or multiterminal setting). This article presents a chronological survey of the multiple proposals to address the problem, together with recent trends and enigmatic conjectures posed decades ago that promote further research.
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.
