One-to-all fastest durations for constant-delay interval temporal graphs

Determine whether the $\widetilde{\mathcal O}(nM)$ complexity of computing one-to-all temporal profiles also applies to interval temporal graphs with constant delays, and consequently whether one-to-all fastest-path durations can be computed within that complexity.

Background

For uniform zero delay, the paper explains that its profile method can be extended to compute one-to-all profiles in $\widetilde{\mathcal O}(nM)$ time, despite the possible linear-in-M size of each individual profile. The conclusion asks whether this complexity bound extends beyond zero delay to interval temporal graphs with constant delays. A positive answer would also yield an algorithm for computing one-to-all fastest durations and could potentially resolve the earlier near-linear complexity question.