Implementing Fast Flows via MAOs

Flows can be found everywhere – when calculating the maximum amount of water that can be carried through pipe and canal systems, when rounding up demographic data or also for calculating the next excavation shaft in surface mining. In this master thesis, algorithms for the calculation of maximum flows are to be implemented, which scale and are competitive in computing time with the fastest state-of-the-art solutions available today. As a new approach, structural insights into maximum adjacency orderings will be used to achieve the speed advantage.

This Master’s thesis therefore requires

• Expertise in C++,
• the ability to write efficient C++ code for algorithms and the underlying graph data structure,
• Knowledge of graphs and interest in graph theory and algorithms.

The results of this implementation are to be made available open source and cross-platform. If you are interested in this work, please contact me by email.