Fig. 9From: Algorithms for optimal min hop and foremost paths in interval temporal graphsSpeedups over Wu’s algorithm for foremost paths on Koblenz datasetsBack to article page