Fig. 6From: Efficient computation of optimal temporal walks under waiting-time constraintsAverage number of visited vertices and its influence on the average running time for foremost. Each data point represents 100 runs of our algorithm for foremost for one of the considered graphs for a specific β-value. The x-coordinate represents the average number of visited vertices and the y-coordinate indicates the average running timeBack to article page