Refine
Year of publication
- 2009 (2)
Document Type
- Diploma Thesis (1)
- Report (1)
Language
- English (2)
Has Fulltext
- yes (2)
Keywords
Faculty / Organisational entity
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.