Fig. 1From: Efficient computation of optimal temporal walks under waiting-time constraintsA temporal graph (with time-labeled arcs called time-arcs) with maximum waiting time four in which the only temporal walk from A to C visits B twiceBack to article page