Fig. 7

Scatterplots of mean performance score versus the mean normalized runtime for five networks. To make the figures clearer, we plotted the data in three subplots and added greedy as a reference to all subplots. On the first subplot, the relatively accurate and fast algorithms are depicted. On the second subplot, we can see the slower algorithms. Here behold that the normalized time is on a logarithmic scale. On the third subplot, the relatively inaccurate algorithms are shown