TY - GEN
A1 - Steiner, Mechthild
T1 - A Survey of Earliest Arrival Flows and a Study of the Series-Parallel Case
N2 - This work is concerned with dynamic flow problems, especially maximal dynamic flows and earliest arrival flows - also called universally maximal flows. First of all, a survey of known results about existence, computation and approximation of earliest arrival flows is given. For the special case of series-parallel graphs a polynomial algorithm for computing maximal dynamic flows is presented and this maximal dynamic flow is proven to be an earliest arrival flow.
KW - earliest arrival flow
KW - maximal dynamic flow
KW - series-parallel graphs
Y1 - 2009
UR - https://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/2175
UR - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:hbz:386-kluedo-16357
ER -