Skip to main content
Fig. 5 | Applied Network Science

Fig. 5

From: Efficient computation of optimal temporal walks under waiting-time constraints

Fig. 5

Impact of different β-values on the number of cycles, the running time, and the number of vertices that can be reached by temporal walks from the chosen starting vertices. Each data point represents 100 runs for a specific β-value for randomly selected starting vertices in the same graph (the same vertices where used for all β-values). The symbol of the data point represents the input graph, the color represents the average number of visited vertices, and the x-coordinate represents the chosen β-value (for the sake of comparability in terms of β-value divided by the graphs lifetime). The y-coordinate represents in the two upper plots the average number of cycles in optimal walks to all reached vertices and in the bottom two plots the average running time for each source vertex. A line connects all data points that use the same graph. The two plots on the left side show results for foremost walks and the two plots on the right side show results for cheapest walks

Back to article page