Sumários

Teo11

15 Maio 2018, 13:00 • Isabel Gama Nunes

No lecture.

TP10

8 Maio 2018, 15:00 • Isabel Gama Nunes

Resolution of exercises 6, 7.

Teo10

8 Maio 2018, 13:00 • Isabel Gama Nunes

Network flow.

A first application: The bipartite matching problem.

Disjoint paths in directed and undirected graphs.

Extensions to the maximum­ flow problem: Circulation with demands; circulations with demands and lower bounds.

TP9

24 Abril 2018, 15:00 • Isabel Gama Nunes

Resolution of exercises 2, 4, 5.

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.