A Survey of Earliest Arrival Flows and a Study of the Series-Parallel Case
- 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.
| Author: | Mechthild Steiner |
|---|---|
| URN: | urn:nbn:de:hbz:386-kluedo-16357 |
| Document Type: | Diploma Thesis |
| Language of publication: | English |
| Year of Completion: | 2009 |
| Year of first Publication: | 2009 |
| Publishing Institution: | Technische Universität Kaiserslautern |
| Granting Institution: | Technische Universität Kaiserslautern |
| Date of the Publication (Server): | 2010/07/21 |
| Tag: | earliest arrival flow; maximal dynamic flow; series-parallel graphs |
| Faculties / Organisational entities: | Kaiserslautern - Fachbereich Mathematik |
| DDC-Cassification: | 5 Naturwissenschaften und Mathematik / 510 Mathematik |
| Licence (German): |
