Teo9

24 Abril 2018, 13:00 • Isabel Gama Nunes

Network flow.

The maximum­ flow problem and the Ford­Fulkerson algorithm.

Maximum flows and minimum cuts in a flow network.

Choosing good augmenting paths.