Sciweavers

Share
NETWORKS
2011

Earliest arrival flows on series-parallel graphs

8 years 1 months ago
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.
Stefan Ruzika, Heike Sperber, Mechthild Steiner
Added 14 May 2011
Updated 14 May 2011
Type Journal
Year 2011
Where NETWORKS
Authors Stefan Ruzika, Heike Sperber, Mechthild Steiner
Comments (0)
books