Abstract
The construction of fault-tolerant graphs is a trade-off between costs and degree of fault-tolerance. Thus the construction of such graphs can be viewed as a two-criteria optimization problem. Any algorithm therefore should be able to generate a Pareto-front of graphs so that the right graph can be chosen to match the application and the user’s need. In this work algorithms from three different domains for the construction of fault-tolerant graphs are evaluated. Classical graph-theoretic algorithms, optimization and bio-inspired approaches are compared regarding the quality of the generated graphs as well as concerning the runtime requirements. As result, recommendations for the application of the right algorithm for a certain problem class can be concluded.
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.
