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.

• Type: Journal
• Year: 2011
• Where: NETWORKS
• Authors: Stefan Ruzika, Heike Sperber, Mechthild Steiner
• Keywords: Arrival flow Problem, Computer Networks, Earliest Arrival, Exact Algorithm, NETWORKS 2011