Course of Combinatorial Optimization and Graph Theory, ORCO

Slides :

  • Flows (pdf)

  • Push-Relabel Algorithm (pdf), Execution of the Push-Relabel Algorithm (pdf)

  • Matchings in bipartite graphs (pdf), Execution of the Hungarian Method (pdf)

  • Matchings in general graphs (pdf), Execution of Edmonds' Algorithm (pdf)

  • Matroids (pdf)

  • Applications of submodular functions (pdf)

    Papers to be presented :