On the Efficiency of Nature-Inspired Algorithms for Generation of Fault-Tolerant Graphs

In this study several algorithms for the generation of inexpensive and fault-tolerant graphs are evaluated with respect to the quality of the found graphs and to the runtime requirements. A special focus lies on the properties of the algorithm that basically is a simulation of the foraging of the slime mold Physarum polycephalum, since in many other works the deployment of this algorithm does not go beyond the conclusion, that the algorithm is capable to generate a graph, while quality of the graph and runtime requirements of the algorithm are not reported. Our results show that the slime mold algorithm has some interesting features, however it is not the best means to construct highly efficient graphs out of large sets of nodes.