Dp 341 en

From DCEwiki
Revision as of 22:33, 24 March 2010 by Sova (talk | contribs)
Jump to: navigation, search

Author: Hanáková Elvíra

Diplomové práce 2009

The thesis focuses on the network ows and on the algorithms designed to solve network's ows issues. Diploma work mainly desribes Multicommodity ow problem in the trafic. We mention a lot of algorithms specialized on such a problem as well as their usage, advantages and disadvantages. As a part of the work there are some examples from the "real life". Scope of the other part is implementation itself. Algorithms are explained and desribed in detail, including their inputs parametres and their usage.For all of these algorithms many measurements were made, which verify their time complexity. There is further documentation, selftests and demo attached to the work in the annexes and CD.