KLUEDO RSS FeedKLUEDO Dokumente/documents
https://kluedo.ub.uni-kl.de/index/index/
Wed, 21 Jul 2010 13:20:49 +0200Wed, 21 Jul 2010 13:20:49 +0200A Survey of Earliest Arrival Flows and a Study of the Series-Parallel Case
https://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/2175
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.Mechthild Steinerdiplomhttps://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/2175Wed, 21 Jul 2010 13:20:49 +0200Earliest Arrival Flows in Series-Parallel Graphs
https://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/2137
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 Steinerreporthttps://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/2137Tue, 06 Oct 2009 15:31:20 +0200