Flow Algorithms (3h)

Université Montpellier 2

M1

This course was a one-time cover and approached the Hungarian Method to solve maximum flow of minimum cost.

Teaching types: