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. (C) 2010 Wiley Periodicals, Inc. NETWORKS, Vol. 57(2), 169-173 2011
earliest arrival flows series-parallel graphs discrete time setting dynamic network flows universally maximal dynamic flows polynomial algorithms