Get access

Earliest arrival flows on 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. © 2010 Wiley Periodicals, Inc. NETWORKS, Vol. 57(2), 169–173 2011

Get access to the full text of this article