Earliest Arrival Flows in Series-Parallel Graphs

• We present an exact algorithm for computing an earliest arrival flow in a discrete time setting on series-parallel graphs. In contrast to previous results for the earliest arrival flow problem this algorithm runs in polynomial time.

$Rev: 12793$