T9
2 Maio 2017, 13:00 • Isabel Gama Nunes
Network flow.
The maximum flow problem and the FordFulkerson algorithm.
Maximum flows and minimum cuts in a flow network.
Choosing good augmenting paths.
2 Maio 2017, 13:00 • Isabel Gama Nunes
Network flow.
The maximum flow problem and the FordFulkerson algorithm.
Maximum flows and minimum cuts in a flow network.
Choosing good augmenting paths.