Fig. 2From: Efficient computation of optimal temporal walks under waiting-time constraintsA proximity network modeled as a static graph (a) and a closer look at the days in which the proximity contacts occur (b-d)Back to article page